Search Algorithms and Their Implementation.
D. W. Loveland · 1982
Abstract : Research that has resulted in completed papers involved (1) optimality of search procedures (decision trees) in binary testing; (2) a study of signature table representation for evaluation functions and methods for dynamically improving function accuracy; (3) pruning minimax trees that have been adapted to incorporate moves determined by chance; and (4) the search problem in automated program construction. Preliminary results have been obtained in research on (a) optimizing limited resource is to guide otherwise random search; (b) studying search strategies in two-person games when information is partly concealed; and (c) limiting search in debugging rule sets in one type of expert knowledge system. Other investigations are in progress. (Author)