N by N Checkers is Exptime Complete
From MaRDI portal
Publication:3316590
DOI10.1137/0213018zbMath0533.68043OpenAlexW2083659666WikidataQ55880676 ScholiaQ55880676MaRDI QIDQ3316590
Publication date: 1984
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0213018
Related Items (22)
On variants of vertex geography on undirected graphs ⋮ Darwinian evolution in games with perfect information ⋮ Unnamed Item ⋮ A short certificate of the number of universal optimal strategies for stopping simple stochastic games ⋮ Backgammon is hard ⋮ Restricted Power - Computational Complexity Results for Strategic Defense Games ⋮ Phutball is PSPACE-hard ⋮ On the complexity of computational problems associated with simple stochastic games ⋮ Classifying the computational complexity of problems ⋮ QUIXO is EXPTIME-complete ⋮ On the fairness and complexity of generalized \(k\)-in-a-row games ⋮ A finite set of functions with an EXPTIME-complete composition problem ⋮ Complexity of path-forming games ⋮ An algorithmic analysis of the Honey-Bee game ⋮ Lower bounds for multiplayer noncooperative games of incomplete information ⋮ Computer Go: An AI oriented survey ⋮ The computational complexity of Angry Birds ⋮ Turing machines with access to history ⋮ Complexity of path discovery game problems ⋮ Recent results and questions in combinatorial game complexities ⋮ The Othello game on an \(n\times n\) board is PSPACE-complete ⋮ Decision algorithms for multiplayer noncooperative games of incomplete information
This page was built for publication: N by N Checkers is Exptime Complete
