Computational complexity of games and puzzles
David Eppstein
http://www.ics.uci.edu/~eppstein/cgt/hard.html
Cited by:
Playing games with algorithms: algorithmic combinatorial game theory
The Complexities of Puzzles, Cross Sum and their Another Solution Problems (ASP)
On the NP-completeness of the Slither Link Puzzle
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
