{"type":"ScholarlyArticle","title":"Using Payoff-Similarity to Speed Up Search","authors":[{"name":"Timothy Furtak","slug":"timothy-furtak","given":"Timothy","family":"Furtak","affiliation":""},{"name":"Michael Buro","slug":"michael-buro","given":"Michael","family":"Buro","affiliation":""}],"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.","doi":"10.5591/978-1-57735-516-8/IJCAI11-097","url":"https://ijcai.org/proceedings/2011/97","pdf":"https://ijcai.org/proceedings/2011/0097.pdf","markdown":"https://ijcai.org/proceedings/2011/97.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/97","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":97,"pages":{"first":534,"last":538},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}