|
Computer chess programs have often been criticized for their superficial
play. The reasons for this are obvious. The program selects its best move based on what can be seen within the search
tree... Chess grandmasters analyze variations as the computer does, but they [do] so with a long-range plan in mind.
These plans are arrived at by a detailed examination of the potential possibilities that the position has to offer. A strategy
is then devised for achieving this plan... Using long-range planning in chess programs, we can help minimize some the effects
of short-sightedness of the search tree. After deciding on a long-range strategy, the program can make moves in the short
term (i.e., within the scope of the tree) consistent with a long-range objective whose attainability may be beyond the depth
of the search tree. In a sense then, the program can achieve greater foresight.
|
