Finding optimal solutions to atomix

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

Volumn 2174, Issue , 2001, Pages 229-243

  Hüffner, Falk ^a   Edelkamp, Stefan ^b   Fernau, Henning ^a   Niedermeier, Rolf ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; COMPUTER GAMES; HEURISTIC ALGORITHMS; HEURISTIC METHODS; OPTIMAL SYSTEMS; OPTIMIZATION;

BRANCHING FACTORS; HEURISTIC SEARCH METHODS; LIMITED MEMORY ALGORITHMS; MEMORY SAVINGS; OPTIMAL SOLUTIONS; PRIORITY QUEUES; PROBLEM SPACE; PSPACE-COMPLETE;

ARTIFICIAL INTELLIGENCE;

EID: 84974676505     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45422-5_17     Document Type: Conference Paper

References (20)

1. J. C. Culberson. Sokoban is PSPACE-complete. In E. Lodi, L. Pagli, and N. Santoro, editors, Proc. FUN-98, pp. 65-76. Carleton Scientific, Waterloo, 1998.
2. J. C. Culberson and J. Schaeffer. Pattern databases. Computational Intelligence, 14(3):318-334, 1998.
3. E. D. Demaine, M. L. Demaine, and J. O’Rourke. PushPush and Push-1 are NPhard in 2D. In Proc. 12th Canadian Conf. Computational Geometry, pp. 211-219, Fredericton, 2000.
4. J. Eckerle and S. Schuierer. Efficient memory-limited graph search. In Proc. KI-95, vol. 981 of LNCS/LNAI, pp. 101-112. Springer, Berlin, 1995.
5. S. Edelkamp and R. E. Korf. The branching factor of regular search spaces. In Proc. AAAI-98/IAAI-98, pp. 299-304. AAAI Press, Menlo Park, 1998.
6. S. Edelkamp, A. L. Lafuente, and S. Leue. Protocol verification with heuristic search. In AAAI-Spring Symposium on Model-based Validation of Intelligence, pp. 75-83, 2001.
7. S. Edelkamp and U. Meyer. Theory and Practice of Time-Space Trade-Offs in Memory Limited Search. This volume.
8. S. Edelkamp and S. Schrödl. Localizing A*. In Proc. AAAI-00/IAAI-00, pp. 885-890. AAAI Press, Menlo Park, 2000.
9. O. Hansson, A. Mayer, and M. Yung. Criticizing solutions to relaxed models yields powerful admissible heuristics. Information Sciences, 63(3):207-227, 1992.
10. P. E. Hart, N. J. Nilsson and B. Raphael. A formal basis for heuristic determination of minimum path cost. IEEE Transactions on on Systems Science and Cybernetics, 4:100-107, 1968.
11. G. J. Holzmann. On limits and possibilities of automated protocol analysis. In Proc. International Conf. Protocol Specification, Testing, and Verification, pp. 339-346, Zürich, 1987. North-Holland, Amsterdam.
12. M. Holzer and S. Schwoon. Assembling Molecules in Atomix is Hard. Technical Report 0101, Institut für Informatik, Technische Universität München, May 2001.
13. A. Junghanns and J. Schaeffer. Sokoban: Enhancing general single-agent search methods using domain knowledge. Artificial Intelligence, 129(1-2):219-251, 2001.
14. R. E. Korf. Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.
15. R. E. Korf and L. A. Taylor. Finding optimal solutions to the Twenty-Four Puzzle. In Proc. AAAI-96/IAAI-96, pp. 1202-1207. AAAI Press, Menlo Park, 1996.
16. H. W. Kuhn. The Hungarian Method for the Assignment Problem. In Naval Res. Logist. Quart, pp. 83-98, 1955.
17. D. Ratner and M. K. Warmuth. The (n2 − 1)-puzzle and related relocation problems. Journal of Symbolic Computation, 10(2):111-137, 1990.
18. A. Reinefeld and T. A. Marsland. Enhanced iterative-deepening search. IEEE Transactions on Pattern Analysis and Machine Intelligence, 16(7):701-710, 1994.
19. U. Stern and D. L. Dill. Combining state space caching and hash compaction. In Methoden des Entwurfs und der Verifikation digitaler Systeme, 4. GI/ITG/GME Workshop, Berichte aus der Informatik, pp. 81-90, 1996. Shaker, Aachen.
20. P. Wolper and D. Leroy. Reliable hashing without collision detection. In Proc. CAV-93, pp. 59-70. Springer, Berlin, 1993.