Long-range planning in computer chess

Abstract

A serious deficiency in game-playing, tree-searching programs is their short-sightedness. Program strategy revolves around the maximization/minimization of what is attainable within the scope of the search tree with little consideration of what lies beyond. This paper describes Planner, a long-range chess strategist that assesses positions, determines a long-range strategy, and makes moves in the short-term (within the scope of the search tree) consistent with a long-term objective (beyond the depth of the search tree). In effect then, Planner allows the program to “see” beyond the limitations of the search tree.