Searching with pattern databases

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1081, Issue , 1996, Pages 402-416

  Culberson, Joseph C ^a   Schaeffer, Jonathan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957879055     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61291-2_68     Document Type: Conference Paper

References (16)

1. J. Culberson and J. Schaeffer. Efficiently Searching the 15-Puzzle, TR 94-08, Department of Computing Science, University of Alberta.
2. R. Gasser. Harnessing Computational Resources for Efficient Exhaustive Search. Ph.D., ETH Zurich, Switzerland, December, 1994.
3. O. Hansson, A. Mayer and M. Yung. Criticizing Solutions to Relaxed Models Yields Powerful Admissible Heuristics. Information Sciences, vol. 63, no. 3, pp. 207-227, 1992.
4. W. Holst. Unpublished research, University of Alberta, 1995.
5. E. Horowitz and S. Sahni. Fundamentals of Computer Algorithms, Computer Science Press, 1978.
6. R. Korf. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search. Artificial Intelligence, vol. 27, no. 1, pp. 97-109, 1985.
7. R. Korf. Planning as Search: A Quantitative Approach Artificial Intelligence, vol. 33, no. 1, pp. 65-88, 1987.
8. R. Korf. Real-Time Heuristic Search. Artificial Intelligence, vol. 42, no. 2-3, pp. 189-211, 1990.
9. R. Korf. Linear-Space Best-First Search. Artificial Intelligence, vol. 62, no. 1, pp. 41-78, 1993.
10. G. Manzini. BIDA*: An Improved Perimeter Search Algorithm Artificial Intelligence, vol. 75, no. 2, pp. 347-360, 1995.
11. D. Ratner and M. Warmuth. Finding a Shortest Solution for the (N×N)-Extension of the 15-Puzzle is Intractable, Journal of Symbolic Computation, vol. 10, pp. 111-137, 1990.
12. A. 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.
13. A. Reinefeld. Private communication, September, 1993.
14. A. Reinefeld and T. Marsland. Enhanced Iterative-Deepening Search, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 16, no. 7, pp. 701-710, July, 1994.
15. J. Schaeffer, J. Culberson, N. Treloar, B. Knight, P. Lu and D. Szafron. A World Championship Caliber Checkers Program, Artificial Intelligence, vol. 53, no. 2-3, pp. 273-290, 1992.
16. L. Taylor and R. Korf. Pruning Duplicate Nodes in Depth-First Search, AAAI National Conference, pp. 756-761, 1993.