Remarks on history and presence of game tree search and research
Information Theory, Combinatorics, and Search Theory
| Hi-index | 0.00 |
A Boolean function $f : \{0, 1\}^{n} \rightarrow \{0, 1\}$ is called trivial if it depends on only one coordinate. We show that nontrivial Boolean functions of positively correlated random variables are strictly less correlated than the variables themselves. This improves on a correlation inequality of Witsenhausen. Over the last decade, several people in computer science and computer chess have investigated the problem of quality and reliability in game-tree searching, where the heuristic evaluation function is not free of errors. In random models with independent leaf values and independently occuring errors, a phenomenon of pathology was observed: the deeper the search in the tree, the worse the final estimate of the root value. The main result of this note implies that pathology is not only a feature of game trees, but appears in any sequence of increasing bivalued recursion trees with independent leaf values, independently occuring errors, and nontrivial recursion rules.