A chess program has been developed which plays good chess (for a program) using a very simple structure. It is based on a brute force search of the move tree with no forward pruning, using material as the only terminal evaluation function, and using a limited positional analysis at the top level for a tiebreak between moves which are materially equal Because of the transparent structure, this program is proposed as a technological benchmark for chess programs which will continue to improve as computer technology increases.
KeywordsTechnology Program Legal Move Positional Analysis Bottom Position Brute Force Search
Unable to display preview. Download preview PDF.