Recent progress in heuristic search: A case study of the four-peg towers of Hanoi problem

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2324-2329

  Korf, Richard E ^a   Felner, Ariel ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ADDITIVE PATTERN DATABASE HEURISTICS; BREADTH-FIRST SEARCH; HEURISTIC SEARCH; OPTIMAL SOLUTIONS; PARALLEL PROCESSING; PATTERN DATABASE; RECENT PROGRESS; TOWERS OF HANOI;

ARTIFICIAL INTELLIGENCE; HEURISTIC ALGORITHMS; HEURISTIC METHODS;

MODULAR ROBOTS;

EID: 84880902123     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Bode, J.-P., and Hinz, A. 1999. Results and open problems on the Tower of Hanoi. In Proceedings of the Thirtieth Southeastern International Conference on Combinatorics, Graph Theory, and Computing.
2. Culberson, J., and Schaeffer, J. 1998. Pattern databases. Computational Intelligence 14(3):318-334.
3. Dijkstra, E. 1959. A note on two problems in connexion with graphs. Numerische Mathematik 1:269-271.
4. Dillenburg, J., and Nelson, P. 1994. Perimeter search. Artificial Intelligence 65(1):165-178.
5. Dunkel, O. 1941. Editorial note concerning advanced problem 3918. American Mathematical Monthly 48:219.
6. Felner, A.; Meshulam, R.; Holte, R.; and Korf, R. 2004. Compressing pattern databases. In AAAI-04, 638-643.
7. Felner, A.; Korf, R.; and Hanan, S. 2004. Additive pattern database heuristics. JAIR 22:279-318.
8. Frame, J. 1941. Solution to advanced problem 3918. American Mathematical Monthly 48:216-217.
9. Hart, P.; Nilsson, N.; and Raphael, B. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics SSC-4(2):100-107.
10. Hinz, A. M. 1997. The Tower of Hanoi. In Algebras and Combinatorics: Proceedings of ICAC'97, 277-289. Hong Kong: Springer-Verlag.
11. Holte, R.; Newton, J.; Felner, A.; Meshulam, R.; and Furcy, D. 2004. Multiple pattern databases. In ICAPS-2004, 122-131.
12. Korf, R., and Felner, A. 2002. Disjoint pattern database heuristics. Artificial Intelligence 134(1-2):9-22. (Pubitemid 34086577)
13. Korf, R., and Shultze, P. 2005. Large-scale, parallel breadth-first search. In AAAI-05, 1380-1385.
14. Korf, R.; Zhang, W.; Thayer, I.; and Hohwald, H. 2005. Frontier search. JACM 52(5):715-748. (Pubitemid 41527577)
15. Korf, R. 1985. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27(1):97-109. (Pubitemid 15604803)
16. Korf, R. 1997. Finding optimal solutions to Rubik's cube using pattern databases. In AAAI-97, 700-705.
17. Korf, R. 2003. Delayed duplicate detection: Extended abstract. In IJCAI-03, 1539-1541.
18. Korf, R. 2004. Best-first frontier search with delayed duplicate detection. In AAAI- 04, 650-657.
19. Manzini, G. 1995. BIDA*, an improved perimeter search algorithm. Artificial Intelligence 75(2):347-360.
20. Stewart, B. 1941. Solution to advanced problem 3918. American Mathematical Monthly 48:217-219.
21. Zhou, R., and Hansen, E. 2006. Breadth-first heuristic search. Artificial Intelligence 170(4-5):385-408.