A selective macro-learning algorithm and its application to the N × N sliding-tile puzzle

Journal of Artificial Intelligence Research

Volumn 8, Issue , 1998, Pages 223-263

  Finkelstein, Lev ^a   Markovitch, Shaul ^b  

^a IBM HAIFA RESEARCH LAB   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 2542504100     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.484     Document Type: Article

References (5)

1. Bui, T. (1997). Solving the 8-puzzle with genetic programming. In Koza, J. R. (Ed.), Genetic Algorithms and Genetic Programming at Stanford, pp. 11-17. Stanford Bookstore, Stanford, California.
2. Cohen, W. W. (1992). Using distribution-free learning theory to analyze solution path caching mechanisms. Computational Intelligence, 8(2), 336-375.
3. Etzioni, O., & Etzioni, R. (1994). Statistical methods for analyzing speedup learning experiments. Machine Learning, 14, 333-347.
4. Fikes, R. E., Hart, P. E., & Nilsson, N. J. (1972). Learning and executing generalized robot plans. Artificial Intelligence, 3, 251-288.
5. Tait, P. G. (1880). Note on the theory of the "15 puzzle". Proceedings of the Royal Society of Edinburgh, 10, 664-665.