Proceedings

Using Payoff-Similarity to Speed Up Search

Download BibTeX Cite

Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence. Pages 534-538.

https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-097

Abstract

Transposition tables are a powerful tool in search domains for avoiding duplicate effort and for guiding node expansions. Traditionally, however, they have only been applicable when the current state is exactly the same as a previously explored state. We consider a generalized transposition table, whereby a similarity metric that exploits local structure is used to compare the current state with a neighbourhood of previously seen states. We illustrate this concept and forward pruning based on function approximation in the domain of Skat, and show that we can achieve speedups of 16+ over standard methods.

Timothy Furtak, and Michael Buro. 2011. Using Payoff-Similarity to Speed Up Search. In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, IJCAI-11. IJCAI, 534–538. https://doi.org/10.5591/978-1-57735-516-8/IJCAI11-097
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards