N by N Checkers is Exptime Complete
Abstract
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In
Copyright
History
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
-
Joint Review of The Mathematics of Various Entertaining Subjects ACM SIGACT News, Vol. 54, No. 1 | 1 March 2023
-
Algorithmen – Berechenbarkeit und Komplexität Grundkurs Informatik | 29 November 2023
-
Backgammon Is Hard Combinatorial Optimization and Applications | 11 December 2021
-
QUIXO is EXPTIME-complete Information Processing Letters, Vol. 162 | 1 Oct 2020
-
The computational complexity of Angry Birds Artificial Intelligence, Vol. 280 | 1 Mar 2020
-
Squares, Cats and Mazes: The Art and Magic of Spatial Complexity Spatial Complexity | 3 November 2020
-
Algorithmen – Berechenbarkeit und Komplexität Grundkurs Informatik | 10 July 2020
-
Complexity of checkers and draughts on different board sizes ICGA Journal, Vol. 40, No. 4 | 25 Mar 2019
-
Marketing Meets Data Science: Bridging the Gap Business and Consumer Analytics: New Ideas | 31 May 2019
-
Rating Computer Science via Chess Computing and Software Science | 5 October 2019
-
On variants of Vertex Geography on undirected graphs Discrete Applied Mathematics, Vol. 251 | 1 Dec 2018
-
Desktop Tower Defense Is NP-Hard Trends in Artificial Intelligence: PRICAI 2016 Workshops | 25 June 2017
-
The Size of BDDs and Other Data Structures in Temporal Logics Model Checking IEEE Transactions on Computers, Vol. 65, No. 10 | 1 Oct 2016
-
Algorithmen – Berechenbarkeit und Komplexität Grundkurs Informatik | 2 August 2016
-
Algorithmen – Berechenbarkeit und Komplexität Grundkurs Informatik | 6 March 2015
-
Theory of Combinatorial Games Handbook of Game Theory with Economic Applications | 1 Jan 2015
-
An algorithmic analysis of the Honey-Bee game Theoretical Computer Science, Vol. 452 | 1 Sep 2012
-
Scrabble Is PSPACE-Complete Fun with Algorithms | 1 Jan 2012
-
Phutball is PSPACE-hard Theoretical Computer Science, Vol. 411, No. 44-46 | 1 Oct 2010
-
Computational Complexity of Two-Dimensional Platform Games Fun with Algorithms | 1 Jan 2010
-
Bibliography Games, Puzzles, and Computation | 15 April 2011
-
Computational Complexity Theory Wiley Encyclopedia of Computer Science and Engineering | 16 March 2009
-
Chapter 4 A Status Report on the P Versus NP Question Advances in Computers | 1 Jan 2009
-
A finite set of functions with an EXPTIME-complete composition problem Theoretical Computer Science, Vol. 407, No. 1-3 | 1 Nov 2008
-
Constraint Logic: A Uniform Framework for Modeling Computation as Games 2008 23rd Annual IEEE Conference on Computational Complexity | 1 Jun 2008
-
Note bibliografiche Algoritmi | 1 Jan 2008
-
On the fairness and complexity of generalized k -in-a-row games Theoretical Computer Science, Vol. 385, No. 1-3 | 1 Oct 2007
-
Decision algorithms for multiplayer noncooperative games of incomplete information Computers & Mathematics with Applications, Vol. 43, No. 1-2 | 1 Jan 2002
-
Lower bounds for multiplayer noncooperative games of incomplete information Computers & Mathematics with Applications, Vol. 41, No. 7-8 | 1 Apr 2001
-
Basic complexity Aspects of Complexity | 31 Jan 2001
-
Playing Games with Algorithms: Algorithmic Combinatorial Game Theory Mathematical Foundations of Computer Science 2001 | 5 September 2001
-
Recent results and questions in combinatorial game complexities Theoretical Computer Science, Vol. 249, No. 2 | 1 Oct 2000
-
Complexity of path discovery game problems Theoretical Computer Science, Vol. 237, No. 1-2 | 1 Apr 2000
-
Fundamentals of computing (a cheatlist) ACM SIGACT News, Vol. 27, No. 3 | 1 September 1996
-
On the complexity of computational problems associated with simple stochastic games Computing and Combinatorics | 4 June 2005
-
A short certificate of the number of universal optimal strategies for stopping simple stochastic games Information Processing Letters, Vol. 57, No. 1 | 1 Jan 1996
-
The Othello game on an n × n board is PSPACE-complete Theoretical Computer Science, Vol. 123, No. 2 | 1 Jan 1994
-
Complexity of path-forming games Theoretical Computer Science, Vol. 110, No. 1 | 1 Mar 1993
-
On the complexity of some coloring games Graph-Theoretic Concepts in Computer Science | 7 June 2005
-
Turing machines with access to history Information and Computation, Vol. 89, No. 2 | 1 Dec 1990
-
Generalized planar matching Journal of Algorithms, Vol. 11, No. 2 | 1 Jun 1990
-
Machine Models and Simulations Algorithms and Complexity | 1 Jan 1990
-
A Catalog of Complexity Classes Algorithms and Complexity | 1 Jan 1990
-
Classifying the computational complexity of problems The Journal of Symbolic Logic, Vol. 52, No. 1 | 12 March 2014
-
Darwinian evolution in games with perfect information Biological Cybernetics, Vol. 55, No. 5 | 1 Feb 1987
-
Darwinian evolution in games with perfect information Biological Cybernetics, Vol. 55, No. 5 | 1 Feb 1987
-
Inefficiency and Intractability Algorithmics | 1 Jan 1987
-
Alternation with restrictions on looping Information and Control, Vol. 67, No. 1-3 | 1 Oct 1985
-
The NP-completeness column: An ongoing guide Journal of Algorithms, Vol. 4, No. 4 | 1 Dec 1983
-
Ineffizienz und Unhandhabbarkeit Algorithmik
-
Combinatorial games with exponential space complete decision problems Mathematical Foundations of Computer Science 1984
View Options
Get Access
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].