Playing games with algorithms: algorithmic combinatorial game theory
Erik D. Demaine
ACM Computing Research Repository, cs.CC/0106019
Cites:
Phutball endgames are hard
Computational complexity of games and puzzles
On the NP-completeness of cryptarithms
One-dimensional peg solitaire, and duotaire
[
D. Eppstein publications
] [
Citation database
] [
Documents
]
Fano
Experimental Web Server,
D. Eppstein
,
School of Information & Computer Science
,
UC Irvine
