search algorithms

Even knowledge-intensive games call for search. The traditional game search (now old-fashioned even for chess programs) is full-width to a fixed depth, with a quiescence search below that depth. The newer rational search algorithms are founded on decision theory. They estimate the utility of spending search effort on different nodes, so that no separate quiescence search is needed. Rational search is difficult, but promising.

quiescence search - what it is and why it’s useful

consistency search - a quiescence search algorithm

rational search - an important research area