• Publications
  • Influence
The B* Tree Search Algorithm: A Best-First Proof Procedure
  • H. Berliner
  • Mathematics, Computer Science
  • Artif. Intell.
  • 1 May 1979
The algorithm, which is named B*, finds a proof that an arc at the root of a search tree is better than any other by attempting to find both the best arc atThe root and the simplest proof, in best-first fashion. Expand
Chess as problem solving: the development of a tactics analyzer.
The author considers the fact that chess programs have made almost no gain in strength, as measured on the human scale, in the period 1968 - 1973, as indicative that the popular model of computer chess is near the limits of its exploitability. Expand
AI's greatest trends and controversies
A set of distinguished scholars and practitioners who were involved in AI's formative stages to describe the most notable trend or controversy during AI's development are asked. Expand
On the Construction of Evaluation Functions for Large Domains
It is shown how to create sensitive evaluation functions and how to avoid stability problems in non-linear functions and two effects, not previously found in the literature: the suicide construction, and the blemish effect. Expand
Measuring the Performance Potential of Chess Programs
The data indicates that once a depth of “tactical sufficiency” is reached, a knowledgeable program can beat a significantly less knowledgeable one almost all of the time when both are searching to the same depth. Expand
Experiences in Evaluation with BKG - A Program that Plays Backgammon
New insights are discussed about the s t r u c t u r e of evaluat ion functions for a large domain such as backgammon and the building of opponent models based upon what evidence shows the o p p o n e n t knows in each state-class. Expand
Artificial Intelligence Techniques
ion ......... . Distributed Problem Solving Goal Structure . . . . . . Hierarchical Planning . . Interactions Between Subsolutions ...... . Library-based Planning Macro Operators . . . . .Expand
Experiences Gained in Constructing and Testing a Chess Program
This paper is an attempt to document the structure of one program, and to shed some light on the pitfalls that may be expected and the work involved in developing a competent program. Expand
Some Necessary Conditions for a Master Chess Program
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. Expand
Backgammon Computer Program Beats World Champion
This paper examines the scientific issues involved in constructing the program, an analysis of its performance, and the scientific significance of the win and presents the SNAC method of constructing evaluation functions. Expand