Author:
Houston Robin,White Joseph,Amos Martyn
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference10 articles.
1. Lexaloffle Games, Zen Puzzle Garden, trial version downloadable at http://www.lexaloffle.com/zen.htm.
2. M. Amos, J. Coldridge, A genetic algorithm for the Zen Puzzle Garden game, Natural Computing (2011), doi:10.1007/s11047-011-9284-7.
3. E. Friedman, Pearl puzzles are NP-complete, Technical Report, Stetson University, 2002.
4. The planar Hamiltonian circuit problem is NP-complete;Garey;SIAM J. Comput.,1976
5. How to draw a planar graph on a grid;de Fraysseix;Combinatorica,1990
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Evaluating Standard Search Enhancements Performance in Zen Puzzle Garden;2023 IEEE CHILEAN Conference on Electrical, Electronics Engineering, Information and Communication Technologies (CHILECON);2023-12-05
2. Hanano Puzzle is NP-hard;Information Processing Letters;2019-05
3. Computational Complexity of Generalized Golf Solitaire;IEICE Transactions on Information and Systems;2015
4. Computational Complexity of Generalized Forty Thieves;IEICE Transactions on Information and Systems;2015
5. Generalized Pyramid is NP-Complete;IEICE Transactions on Information and Systems;2013