Layer-Abstraction for Symbolically Solving General Two-Player Games

One of the latest prominent results was by Schaeffer In recent years general game playing has received an increasing et al. (2007), who were able to solve American Checkers after amount of attention, especially due to the annual more than ten years of computation and proved that the general game playing competition (Genesereth, Love, and optimal outcome is a draw. Of course, due to the domain Pell 2005) that is held at AAAI or IJCAI since 2005. In independent scenario, we cannot expect to come up with solutions general game playing the agents are provided a description for such complex games in general game playing. of a game according to certain rules and need to play it. In explicit representation, many general games are too In case of multi-player games the agents often play against complex to fit into RAM or even on a hard disk. So, to solve each other, while in case of single-player games the agent them we perform symbolic search, which utilizes binary decision tries to find a sequence of moves to reach a terminal state diagrams (BDDs) (Bryant 1986) as they decrease the where it can achieve the best reward possible. The authors memory consumption, if a good variable ordering is found. of the agents do not know which games will be played, so In this paper we will present a new approach to solve general no domain specific knowledge can be inserted.