Game Tree Search

Bounded depth-first search is usually used, with the alpha-beta algorithm, for game trees. However:

  1. The depth bound may stop search just as things get interesting (e.g. in the middle of a piece exchange in chess [Hsu et al., ``A Grandmaster Chess Machine'', Scientific American, vol. 263, no. 4 (Oct. 1990), pp. 44-50.]). For this reason, the depth bound is usually extended to the end of an exchange.

  2. The search may tend to postpone bad news until after the depth bound: the horizon effect .

Contents    Page-10    Prev    Next    Page+10    Index