Finding Optimal Solutions to Rubik's Cube Using Pattern Databases
暂无分享,去创建一个
[1] Adi Shamir,et al. A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems , 1981, SIAM J. Comput..
[2] E. KorfRichard. Depth-first iterative-deepening: an optimal admissible tree search , 1985 .
[3] Richard E. Korf,et al. Macro-Operators: A Weak Method for Learning , 1985, Artif. Intell..
[4] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[5] Amos Fiat,et al. Planning and learning in permutation groups , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] Jonathan Schaeffer,et al. A World Championship Caliber Checkers Program , 1992, Artif. Intell..
[7] Peter C. Nelson,et al. Perimeter Search , 1994, Artif. Intell..
[8] Simon Kasif,et al. Exploiting Algebraic Structure in Parallel State Space Search , 1994, AAAI.
[9] Hermann Kaindl,et al. How to Use Limited Memory in Heuristic Search , 1995, IJCAI.
[10] Giovanni Manzini,et al. BIDA: An Improved Perimeter Search Algorithm , 1995, Artif. Intell..
[11] Jonathan Schaeffer,et al. Searching with Pattern Databases , 1996, Canadian Conference on AI.