Goto

Collaborating Authors

 Country


Analysis of the alpha-beta pruning algorithm

Classics

Dept. of Computer Science, Carnegie-Mellon University. "Many game-playing programs must search very large game trees. Use of the alpha-beta pruning algorithm instead of the simple minimax search reduces by a large factor the number of bottom positions which must be examined in the search. An analytical expression for the expected number of bottom positions examined in a game tree using alpha-beta pruning is derived, subject to the assumptions that the branching factor N and the depth D of the tree are arbitrary but fixed, and the bottom positions are a random permutation of ND unique values. A simple approximation to the growth rate of the expected number of bottom positions examined is suggested, based on a Monte Carlo simulation for large values of N and D. The behavior of the model is compared with the behavior of the alpha-beta algorithm in a chess playing program and the effects of correlation and non-unique bottom position values in real game trees are examined."


Identification of Conceptualizations Underlying Natural Language

Classics

in Roger Schank and Kenneth Colby (eds), Computer Models of Thought and Language, pp. 187-247, San Francisco: W. H. Freeman and Co., 1973



The proper treatment of quantification in ordinary English

Classics

The aim of this paper is to present in a rigorous way the syntax and semantics of a certain fragment of a certain dialect of English. Patrick Suppes claims, in a paper prepared for the present workshop [the 1970 Stanford Workshop on Grammar and Semantics], that at the present time the semantics of natural languages are less satisfactorily formulated than the grammars ¼ [and] a complete grammar for any significant fragment of natural language is yet to be written.'' This claim would of course be accurate if restricted in its application to the attempts emanating from the Massachusetts Institute of Technology, but fails to take into account the syntactic and semantic treatments proposed in Montague (1970a, b). Thus the present paper cannot claim to present the first complete syntax (or grammar, in Suppes' terminology) and semantics for a significant fragment of natural language; and it is perhaps not inappropriate to sketch relations between the earlier proposals and the one given below. Montague (1970b) contains a general theory of languages, their interpretations, and the inducing of interpretations by translation.




Some necessary conditions for a master chess program

Classics

Since 1967 there has again been great interest in chess programming. This paper demonstrates that the structure of today's most successful programs cannot be extended to play Master level chess. Certain basic requirements of a Master player's performance are shown to be outside the performance limits to which a program of this type could be extended. The paper also examines a basic weakness in the tree-searching model approach when applied to situations that cannot be searched to completion. This is the Horizon Effect, which causes unpredictable evaluation errors due to an interaction between the static evaluation function and the rules for search termination. The outline of a model of chess playing that avoids the Horizon Effect and appears extendable to play Master level chess is presented, together with some results already achieved In IJCAI-73: THIRD INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 20-23 August 1973, Stanford University Stanford, California, pp. 77-85


The structure of belief systems

Classics

In R.C. Schank and K.M. Colby, Computer Models of Thought and Language, pp. 287-339. Limited Preview (Table of Contents and Index) (https://archive.org/details/computermodelsof00scha).



Speech understanding systems: Final report of a study group

Classics

"A five-year interdisciplinary effort by speech scientists and computer scientists has demonstrated the feasibility of programming a computer system to “understand” connected speech, i.e., translate it into operational form and respond accordingly. An operational system (HARPY) accepts speech from five speakers, interprets a 1000-word vocabulary, and attains 91 percent sentence accuracy. This Steering Committee summary report describes the project history, problem, goals, and results." Amsterdam: North- Holland.