Abstract
This paper first considers quiescence searches as special cases of forward pruning. The restriction of quiescence searches to tactical moves only is discussed from this point of view, both with respect to reliability and costs. The inclusion of non-tactical moves is argued to be both promising and inexpensive; analysis of an implementation tends to confirm this.
Get full access to this article
View all access options for this article.