Metaprogramming Forced Moves

Knowledge about forced moves enables to select a small number of moves from the set of possible moves. It is very important in complex domains where search trees have a large branching factor. Knowing forced moves drastically cuts the search trees. We propose a language and a metaprogram to create automatically the knowledge about interesting and forced moves, only given the rules about the direct effects of the moves. We describe the successful application of this metaprogram to the game of Go. It creates rules that give complete sets of forced moves.

• Type: Conference
• Year: 1998
• Where: ECAI
• Authors: Tristan Cazenave
• Keywords: Artificial Intelligence, ECAI 1998, Forced Moves, Moves Enables, Search Trees