Singular Extensions: Adding Selectivity to Brute-Force Searching¹

Article type: Research Article

Authors: Anantharaman, Thomas | Campbell, Murray | Hsu, Feng-hsiung

Affiliations: Department of Computer Science, Carnegie-Mellon University, Pittsburgh, Pennsylvania 15213

Note: [1] This article has been singled out for the first Mephisto Award, – Eds.

Abstract: While the success of the new ACM 1987 North American Computer Chess Champion, ChipTest, has been frequently attributed to its greater search speed, there is evidence that the major factor is a new search-extension technique the program employed. In this paper, we describe this search extension technique which requires no domain-specific knowledge but is based on dynamic knowledge derived from the search and adds little overhead to the underlying brute-force search. Implementation issues and experimental results with ChipTest are presented.

DOI: 10.3233/ICG-1988-11402

Journal: ICGA Journal, vol. 11, no. 4, pp. 135-143, 1988