Tsume Go and One-Eye Problem

Kishimoto's Tsume Go Explorer is the most powerful solver for life and death problems in the world. The one-eye solver solves a specialized subproblem of tsume Go: creating or destroying one eye.

Publications

A. Kishimoto. Correct and Efficient Search Algorithms in the Presence of Repetitions. PhD thesis, University of Alberta, 2005.

pdf.

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.

pdf, 248k.

A. Kishimoto and M. Müller. Dynamic decomposition search: A divide and conquer approach and its application to the one-eye problem in Go. In IEEE Symposium on Computational Intelligence and Games (CIG'05), pages 164-170, 2005.

pdf, 296k.
Erratum: On the final page, "move D6 in R2 makes half an eye" should read: "move D6 in R2 makes one eye".

A. Kishimoto and M. Müller. Search versus knowledge for solving life and death problems in Go. In Twentieth National Conference on Artificial Intelligence (AAAI-05), pages 1374-1379, 2005.

pdf, 261k.

A. Kishimoto and M. Müller. Df-pn in Go: an application to the one-eye problem. In J. van den Herik, H. Iida, and E. Heinz, editors, Advances in Computer Games 10, pages 125 - 141. Kluwer, 2004.

pdf, 157k.

A. Kishimoto and M. Müller. A solution to the GHI problem for depth-first proof-number search. In Proceedings of the 7th Joint Conference on Information Sciences JCIS 2003, pages 489 - 492, 2003.

Created: Jun 23, 2009 Last modified: Jun 23, 2009

Martin Müller