The principle of pressure in chess
Deniz Yuret (1994)
( PS )
The principle of pressure in chess.
In The Third Turkish Symposium on Artificial Intelligence and
This paper presents a new algorithm, ``Pressure Search,'' for growing
min-max game trees. The algorithm is based on the idea of best-first
search. The goal of the search is to find a strategy which will
change the estimated value of the current position. The amount of
pressure, defined as inversely proportional to the number of options
available to the opponent, is used as a heuristic measure of the
remaining distance to the goal. Pressure Search has the potential to
selectively extend parts of the search tree and thus discover deep
combinations faster than standard alpha-beta search.