facite.de


Direkt zum Seiteninhalt

Literatur-Würfel-Mathematik


Bright, J., S. Kasif, and L. Stiller
, Exploiting alge-
braic structure in parallel state space search, Proceed-
ings of the National Conference on Artificial Intelli-
gence (AAAI-94), Seattle, WA, July 1994, pp. 1341-
1346.

Culberson, J.C., and J. Schaeffer
, Searching with pat-
tern databases, Proceedings of the 11th Conference of
the Canadian Society for the Computational Study of
Intelligence, published in Advances in Arti_cial Intel-
ligence, Gordon McCalla (Ed.), Springer Verlag, 1996.
Dillenburg, J.F., and P.C. Nelson, Perimeter search,
Artificial Intelligence, Vol. 65, No. 1, Jan. 1994, pp.
165-178.
Fiat, A., S. Moses, A. Shamir, I. Shimshoni, and G.
Tardos
, Planning and learning in permutation groups,
Proceedings of the 30th A. C. M. Foundations of Com-
puter Science Conference (FOCS), 1989, pages. 274-279.
Joyner, D., Adventures in group theory: Rubik's Cube, Merlin's machine, and Other Mathematical Toys. Baltimore: Johns Hopkins University Press (2002)
Kaindl, H., G. Kainz, A. Leeb, and H. Smetana, How
to use limited memory in heuristic search, Proceedings
of the Fourteenth International Joint Conference on
Artificial Intelligence (IJCAI-95), Montreal, Canada,
Aug. 1995, pp. 236-242.
Korf, R.E., Depth-first iterative-deepening: An opti-
mal admissible tree search, Artificial Intelligence, Vol.
27, No. 1, 1985 (a), pp. 97-109.
Korf, R.E., Macro-operators: A weak method for
learning, Artificial Intelligence, Vol. 26, No. 1, 1985
(b), pp. 35-77.,
Cooperman, C., "Twenty-Six Moves Suffice for Rubik's Cube" . Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC '07). ACM Press (2007).
Manzini, G., BIDA: An improved perimeter search
algorithm, Artificial Intelligence, Vol. 75, No. 2, June
1995, pp. 347-360.
Moews, D., Shamir's method on the super-ip, post-
ing to Cube-Lovers mailing list, Jan. 23, 1995.
Prieditis, A.E., Machine discovery of efective admis-
sible heuristics, Machine Learning, Vol. 12, 1993, pp.
117-141.
Rokicki T., Twenty-Five Moves Suffice for Rubik's Cube. arXiv:0803.3435
Schaeffer, J., J. Culberson, N. Treloar, B. Knight, P.
Lu, and D. Szafron
, A world championship caliber
checkers program, Artificial Intelligence, Vol. 53, No.
2-3, 1992, pp. 273-290.
Schroeppel, R., and A. Shamir, A T = O(2n=2); S =
O(2n=4) algorithm for certain NP-Complete Prob-
lems, SIAM Journal of Computing, Vol. 10, No
. 3,


Zurück zum Seiteninhalt | Zurück zum Hauptmenü