@inproceedings{b9827140d5a141e1b1615965f56ca6c2,
title = "Improving local decisions in adversarial search",
abstract = "Until recently, game-tree pathology (in which a deeper game-tree search results in worse play) has been thought to be quite rare. We provide an analysis that shows that every game should have some sections that are locally pathological, assuming that both players can potentially win the game. We also modify the minimax algorithm to recognize local pathologies in arbitrary games, and cut off search accordingly (shallower search is more effective than deeper search when local pathologies occur). We show experimentally that our modified search procedure avoids local pathologies and consequently provides improved performance, in terms of decision accuracy, when compared with the ordinary minimax algorithm.",
author = "Brandon Wilson and Inon Zuckerman and Austin Parker and Nau, {Dana S.}",
year = "2012",
doi = "https://doi.org/10.3233/978-1-61499-098-7-840",
language = "الإنجليزيّة",
isbn = "9781614990970",
series = "Frontiers in Artificial Intelligence and Applications",
publisher = "IOS Press BV",
pages = "840--845",
booktitle = "ECAI 2012 - 20th European Conference on Artificial Intelligence, 27-31 August 2012, Montpellier, France - Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstration",
address = "هولندا",
note = "20th European Conference on Artificial Intelligence, ECAI 2012 ; Conference date: 27-08-2012 Through 31-08-2012",
}