Abstract
This paper addresses the central problem of search in AI, specializing to chess programs. It surveys traditional ways of searching and stratagems of curtailing search. The paper proposes a few new search techniques, viz. domination search and confidence search.
Get full access to this article
View all access options for this article.
