---
title: "Generalized Amazons is PSPACE-Complete"
authors:
  - "Timothy Furtak"
  - "Masashi Kiyomi"
  - "Takeaki Uno"
  - "Michael Buro"
doi: ""
url: "https://ijcai.org/proceedings/2005/158"
pdf: "https://ijcai.org/proceedings/2005/0158.pdf"
venue: "Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence"
year: 2005
pages: "132-136"
track: ""
keywords:
---

# Generalized Amazons is PSPACE-Complete

Timothy Furtak, Masashi Kiyomi, Takeaki Uno, Michael Buro

*Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence*, pages 132-136.

## Abstract

Amazons is a perfect information board game with simple rules and large branching factors. Two players alternately move chess queen-like pieces and block squares on a 10×10 playing field. The player who makes the last move wins. Amazons endgames usually decompose into independent subgames. Therefore, the game is a natural testbed for combinatorial game theory. It was known that determining the winner of simple generalized Amazons endgames is NP-equivalent. This paper presents two proofs for the PSPACEcompleteness of the generalized version of the full game.