A case study of revisiting best-first vs. depth-first search

Frontiers in Artificial Intelligence and Applications

Volumn 110, Issue , 2004, Pages 141-145

  Auer, Andreas ^a   Kaindl, Hermann ^b  

^a Vienna Univ of Technology ^*  (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMICS; BEST FIRST SEARCH; CASE-STUDIES; DEPTH FIRST; EXPONENTIALS; FIFTEEN PUZZLE; LINEAR SPACES; MANHATTAN DISTANCE; OPTIMAL SOLUTIONS; SPACE REQUIREMENTS;

PROBLEM SOLVING;

EID: 85017378457     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Culberson and J. Schaeffer, 'Searching with pattern databases', in Advances in Artificial Intelligence, ed., G. McCalla, 402-416, Springer- Verlag, Berlin, (1996).
2. R. Dechter and J. Pearl, 'Generalized best-first strategies and the optimality of A', J. ACM, 32(3), 505-536, (1985).
3. H. Kaindl and G. Kainz, Bidirectional heuristic search reconsidered, Journal of Artificial Intelligence Research (JAIR), 7, 283-317, (1997).
4. H. Kaindl, G. Kainz, R. Steiner, A. Auer, and K. Radda, 'Switching from bidirectional to unidirectional search', in Proc. Sixteenth International Joint Conference on Artificial Intelligence (IJCAI-99). San Francisco, CA: Morgan Kaufmann Publishers, (1999).
5. R.E. Korf, Depth-first iterative deepening: An optimal admissible tree search, Artificial Intelligence, 27(1), 97-109, (1985).
6. R.E. Korf and A. Felner, 'Disjoint pattern database heuristics', Artificial Intelligence, 134, 9-22, (2002).
7. R.E. Korf and L.A. Taylor, Finding optimal solutions to the Twenty- Four Puzzle, in Proc. Thirteenth National Conference on Artificial Intelligence (AAAI-96), pp. 1202-1207. Menlo Park, CA: AAAI Press/The MIT Press, (1996).
8. J.B.H. Kwa, BS: An Admissible Bidirectional Staged Heuristic Search Algorithm, Artificial Intelligence, 38(2), 95-109, (1989).
9. E.L. Lawler and D.Wood, Branch-and-bound methods: A survey, Operations Research, 14(4), 699-719, (1966).
10. G. Manzini, BIDA∗: An improved perimeter search algorithm, Artificial Intelligence, 75(2), 347-360, (1995).
11. I. Pohl, Bi-directional search, in Machine Intelligence 6, pp. 127-140, Edinburgh, (1971). Edinburgh University Press.
12. A. Reinefeld and T.A. Marsland, Enhanced iterative-deepening search, IEEE Transactions on Pattern Analysis and Machine Intelligence (PAMI), 16(12), 701-709, (July 1994).
13. L.A. Taylor and R.E. Korf, 'Pruning duplicate nodes in depth-first search', in Proc. Eleventh National Conference on Artificial Intelligence (AAAI-93), pp. 756-761. Menlo Park, CA: AAAI Press/The MIT Press, (1993).
14. W. Zhang and R.E. Korf, Depth-first vs. best-first search: new results, in Proc. Eleventh National Conference on Artificial Intelligence (AAAI- 93), pp. 769-775. Menlo Park, CA: AAAI Press/The MIT Press, (1993).