Strategic pattern generation: A solution technique for a class of games

Abstract

A technique useful in solving problems involving forcing states is developed for the class of position games including n^k tic-tac-toe, Go-Moku, Hex, and Bridg-It. Procedures are described for generating patterns, for determining if a forcing state exists, and for handling that state in a game-playing situation. Starting with only the rules of a game and its board structure, all immediate forcing state can be generated with no learning necessary. The power of the technique lies in the forcing pattern description.