Search

Abstract: The game of Amazons is a young board game with simple rules, nice mathematical properties yet a high complexity between chess and Go. The state of the art Amazons solver was presented by Martin Müller in 2001 with which he solved the Amazons 5 × 5 starting position as a first player win. This thesis presents our work on building Amazons endgame databases, improving the bounds heuristics and using ideas from combinatorial game theory to enhance the solver. With the improvements, we solve the 5 × 6 Amazons starting position as a first player win.