Proof Trees for Weak Achievement Games
Nándor Sieben · 2008
Proof number search and threat-space search are successful techniques for finding winning strategies in achievement games such as go-moku. A version of proof number search can be used effectively to analyze weak achievement games. In this version it is sufficient to consider the defensive moves that are involved in the maker's strategy after null moves. The result of this restricted search is a proof tree. The proof tree can be translated into the usual proof sequence of winning situations used to present winning strategies for weak achievement games. Using this procedure, a proof sequence can be found for a handicap one strategy for weakly achieving Snaky.