Computer Science – Computational Complexity
Scientific paper
2005-02-02
Computer Science
Computational Complexity
7 pages, 5 figures. For 2005 Combinatorial Game Theory Workshop at BIRS
Scientific paper
Amazons is a board game which combines elements of Chess and Go. It has become popular in recent years, and has served as a useful platform for both game-theoretic study and AI games research. Buro showed that simple Amazons endgames are NP-equivalent, leaving the complexity of the general case as an open problem. We settle this problem, by showing that deciding the outcome of an n x n Amazons position is PSPACE-hard. We give a reduction from one of the PSPACE-complete two-player formula games described by Schaefer. Since the number of moves in an Amazons game is polynomially bounded (unlike Chess and Go), Amazons is in PSPACE. It is thus on a par with other two-player, bounded-move, perfect-information games such as Hex, Othello, and Kayles. Our construction also provides an alternate proof that simple Amazons endgames are NP-equivalent. Our reduction uses a number of amazons polynomial in the input formula length; a remaining open problem is the complexity of Amazons when only a constant number of amazons is used.
No associations
LandOfFree
Amazons is PSPACE-complete does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Amazons is PSPACE-complete, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Amazons is PSPACE-complete will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-60949