Usually, in the endgame, the board is partitioned into separate "royal chambers", with queens inside each chamber. We define
simple Amazons endgames to be endgames where each chamber has at most one queen. Determining who wins in a simple Amazons endgame is
NP-hard. This is proven by a
reduction from the problem of finding the
Hamiltonian path of a cubic subgraph of the
square grid graph.
Generalized Amazons (that is, determining the winner of a game of Amazons played on a n x n grid, started from an arbitrary configuration) is
PSPACE-complete. This can be proved in two ways. • The first way is by reducing a generalized
Hex position, which is known to be PSPACE-complete, into an Amazons position. • The second way is by reducing a certain kind of
generalized geography called GEOGRAPHY-BP3, which is PSPACE-complete, to an Amazons position. This Amazons position uses only one black queen and one white queen, thus showing that generalized Amazons is PSPACE-complete even if only one queen on each side is allowed. == References ==