ICGA Journal: The Journal of the Computer Games Community

Theoretical models of error propagation in game trees have been investigated by many researchers. This paper outlines the main ideas of a proof that present generalized backing-up schemes are no better error-correctors than minimax.

In this paper a method is described of recording chess moves in a 64 × 64 array. A graphical representation of this array in which impossible moves are black is dubbed Butterfly Board because butterfly-like patterns appear in them. Two move-ordering heuristics using Butterfly Boards are discussed and compared with Killer Heuristic and Refutation-Table techniques.

Extrapolating from several microcomputer implementations at moderate speed with correspondingly constraint depths of search and complexity of evaluation functions, the author is led to conjecture that there is no difference between

deep search and superficial evaluation, and