Subject
General Computer Science,Theoretical Computer Science
Reference15 articles.
1. Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard;Goldreich,2011
2. The (n2−1)-puzzle and related relocation problems;Ratner;J. Symbolic Comput.,1990
3. Rush Hour is PSPACE-complete, or “why you should generously tip parking lot attendants”;Flake;Theoret. Comput. Sci.,2002
4. Generalized Hi–Q is NP-complete;Uehara;IEICE Trans.,1990
5. The computational complexity of motion planning;Hartline;SIAM Rev.,2003
Cited by
2 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. Fixed-parameter algorithms for graph constraint logic;Theoretical Computer Science;2023-05