{"type":"ScholarlyArticle","title":"Generalized Amazons is PSPACE-Complete","authors":[{"name":"Timothy Furtak","slug":"timothy-furtak","given":"Timothy","family":"Furtak","affiliation":""},{"name":"Masashi Kiyomi","slug":"masashi-kiyomi","given":"Masashi","family":"Kiyomi","affiliation":""},{"name":"Takeaki Uno","slug":"takeaki-uno","given":"Takeaki","family":"Uno","affiliation":""},{"name":"Michael Buro","slug":"michael-buro","given":"Michael","family":"Buro","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/2005/158","pdf":"https://ijcai.org/proceedings/2005/0158.pdf","markdown":"https://ijcai.org/proceedings/2005/158.md","bibtex":"https://ijcai.org/proceedings/2005/bibtex/158","volume":{"slug":"2005","title":"Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2005","url":"https://ijcai.org/proceedings/2005/","year":2005,"location":"Edinburgh, Scotland, UK","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":158,"pages":{"first":132,"last":136},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}