摘要: Single-player games (often called puzzles) have received considerable attention from the scientific community. Consequently, interesting insights into some puzzles, and approaches for solving them, emerged. However, many puzzles been neglected, possibly because they are unknown to people. In this article, we survey NP-Complete in hope of motivating further research fascinating area, particularly those which little date.
wmich.edu
nott.ac.uk 
sokoban.dk 
researchgate.net 参考文章(77)
Richard E. Korf, Larry A. Taylor, Pruning duplicate nodes in depth-first search national conference on artificial intelligence. pp. 756- 761 ,(1993)
Alexander D. Chaffee, Eric V. Siegel, Genetically optimizing the speed of programs evolved to play tetris Advances in genetic programming. pp. 279- 298 ,(1996)
Alexander Reinefeld, Complete solution of the eight-puzzle and the benefit of node ordering in IDA international joint conference on artificial intelligence. pp. 248- 253 ,(1993)
Takayuki Yato, On the NP-completeness of the Slither Link Puzzle ,(2003)
Andreas Junghanns, Jonathan Schaeffer, Pushing the limits: new developments in single-agent search Pushing the limits: new developments in single-agent search. pp. 178- 178 ,(1999) , 10.7939/R3W95103S
Graham Cormode, The Hardness of the Lemmings Game, or "Oh no, more NP-Completeness Proofs" ,(2004)
Rudie W. Tretten, Problem Solving Groups The Clearing House: A Journal of Educational Strategies, Issues and Ideas. ,vol. 47, pp. 177- 178 ,(1972) , 10.1080/00098655.1972.11477721
David Singmaster, Notes on Rubik's 'Magic Cube' ,(1981)
H.J. van den Herik, H. Iida, Games in AI Research Institute for Knowledge and Agent Technology (IKAT), Universiteit van Maastricht. ,(2000)
Masashi Kiyomi, Tomomi Matsui, Integer Programming Based Algorithms for Peg Solitaire Problems Computers and Games. pp. 229- 240 ,(2001) , 10.1007/3-540-45579-5_15