Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE Is Intractable
暂无分享,去创建一个
[1] J. Doran,et al. Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.
[2] Ira Pohl,et al. Joint and LPA*: Combination of Approximation and Search , 1986, AAAI.
[3] Judea Pearl,et al. Heuristics : intelligent search strategies for computer problem solving , 1984 .
[4] R. Korf. Learning to solve problems by searching for macro-operators , 1983 .
[5] Judea Pearl. Intelligent Search Strategies for Computer Problem Solving , 1984 .
[6] Larry A. Rendell,et al. A New Basis for State-Space Learning Systems and a Successful Implementation , 1983, Artif. Intell..
[7] Richard E. Korf,et al. Iterative-Deepening-A*: An Optimal Admissible Tree Search , 1985, IJCAI.
[8] Paul G. Spirakis,et al. Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications , 2015, FOCS.