Our efficient solution to GHI was instrumental in developing the world's strongest tsume Go solver, and in solving checkers. For applications, see our research on tsume Go and seki.
A. Kishimoto. Correct and Efficient Search Algorithms in the Presence of Repetitions. PhD thesis, University of Alberta, 2005.
J. Schaeffer, Y. Björnsson, N. Burch, A. Kishimoto, M. Müller, R. Lake, P. Lu, and S. Sutphen. Solving Checkers. In International Joint Conference on Artificial Intelligence (IJCAI), pages 292-297, 2005.
A. Kishimoto and M. Müller. A solution to the GHI problem for depth-first proof-number search. Information Sciences, 175(4):296-314, 2005.
A. Kishimoto and M. Müller. A general solution to the graph history interaction problem. In Nineteenth National Conference on Artificial Intelligence (AAAI 2004), pages 644-649, San Jose, CA, 2004.