{"type":"ScholarlyArticle","title":"Experimenting with Revisits in Game Tree Search","authors":[{"name":"Subir Bhattacharya","slug":"subir-bhattacharya","given":"Subir","family":"Bhattacharya","affiliation":""}],"abstract":"The oldest known game tree search algorithm Alpha-Beta is still the most popular one. All other algorithms in this area fall short of Alpha-Beta in one or more of the following three desired characteristics - high pruning power, low storage requirement and low execution time. This paper discusses bow revisit of nodes can be used effectively in game tree search. A few strategies of introducing revisits in game tree search are presented. It is demonstrated that for any shape and ordering of the game tree to be searched, there always exists one strategy that, on an average, consistently evaluates less number of terminals than Alpha-Beta in comparable memory and time.","doi":null,"url":"https://ijcai.org/proceedings/1995/32","pdf":"https://ijcai.org/proceedings/1995/0032.pdf","markdown":"https://ijcai.org/proceedings/1995/32.md","bibtex":"https://ijcai.org/proceedings/1995/bibtex/32","volume":{"slug":"1995","title":"Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1995","url":"https://ijcai.org/proceedings/1995/","year":1995,"location":"Montréal, Québec, Canada","dates":"","editors":"Chris S. Mellish","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":32,"pages":{"first":243,"last":250},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}