Experiments With Some Programs That Search Game Trees

Many problems in artificial intelligence involve the searching of large trees of alternative possibilities—for example, game-playing and theorem-proving. The problem of efficiently searching large trees is discussed. A new method called “dynamic ordering” is described, and the older minimax and Alpha-Beta procedures are described for comparison purposes. Performance figures are given for six variations of the game of kalah. A quantity called “depth ratio” is derived which is a measure of the efficiency of a search procedure. A theoretical limit of efficiency is calculated and it is shown experimentally that the dynamic ordering procedure approaches that limit.

[1]  Journal of the Association for Computing Machinery , 1961, Nature.

[2]  H. Gelernter,et al.  Realization of a geometry theorem proving machine , 1995, IFIP Congress.

[3]  James R. Slagle,et al.  A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus , 1963, JACM.

[4]  Allen Newell,et al.  GENERALITY AND GPS , 1967 .

[5]  A. L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[6]  M. Wells,et al.  Experiments in Chess , 1957, JACM.

[7]  E. Feigenbaum,et al.  Computers and Thought , 1963 .

[8]  John McCarthy,et al.  LISP 1.5 Programmer's Manual , 1962 .

[9]  A. L. Samuel,et al.  Some studies in machine learning using the game of checkers. II: recent progress , 1967 .

[10]  S. Amarel.  An Approach to Heuristic Problem Solving and Theorem Proving in the Prepositional Calculus , 1967 .

[11]  Arthur L. Samuel,et al.  Some Studies in Machine Learning Using the Game of Checkers , 1967, IBM J. Res. Dev..

[12]  D. Loveland,et al.  Empirical explorations of the geometry theorem machine , 1960, IRE-AIEE-ACM '60 (Western).

[13]  Herbert A. Simon,et al.  A chess mating combinations program , 1966, AFIPS '66 (Spring).

[14]  James R. Slagle,et al.  Experiments With a Multipurpose, Theorem-Proving Heuristic Program , 1968, JACM.

[15]  A. Bernstein,et al.  A chess playing program for the IBM 704 , 1899, IRE-ACM-AIEE '58 (Western).

[16]  J. Doran,et al.  Experiments with the Graph Traverser program , 1966, Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences.

[17]  Allen Newell,et al.  Chess-Playing Programs and the Problem of Complexity , 1958, IBM J. Res. Dev..

[18]  Clark Weissman,et al.  LISP 1.5 primer , 1967 .

[19]  Nils J. Nilsson,et al.  Searching problem-solving and game-playing trees for minimal cost solutions , 1968, IFIP Congress.

[20]  R SlagleJames,et al.  Experiments With Some Programs That Search Game Trees , 1969 .