The quality of chess programs is based on tree searching; this limits computer chess development. Modern improvements are possible mainly by applying new concepts in a heuristic evaluation of a chess position. While seeking optimal partial solutions to obtain general solutions, one is led to huge programs that solve only a small part of a chess problem. It seems that an optimistic approach is to look for a conceptionally simple and general evaluation function which can be improved by using a computer.
CitationDownload as .RIS
MCB UP Ltd
Copyright © 1976, MCB UP Limited