@inproceedings{ed909fe84d934d109df13e9d25b0aff5,
title = "Similarity pruning in PrOM search",
abstract = "In this paper we introduce a new pruning mechanism, called Similarity Pruning for Probabilistic Opponent-Model (PrOM) Search. It is based on imposing a bound on the differences between two or more evaluation functions. Assuming such a bound exists, we are able to prove two theoretical properties, viz., the bound-conservation property and the bounded-gain property. Using these properties we develop a Similarity-Pruning algorithm. Subsequently we conduct a series of experiments on random game trees to measure the efficiency of the new algorithm. The results show that Similarity Pruning increases the efficiency of PrOM search considerably.",
author = "H.H.L.M. Donkers and {van den Herik}, H.J. and J.W.H.M. Uiterwijk",
note = "Proceedings of the 11th Advances in Computer Games (ACG11) Springer, Berlin Vol.:4250 ; conference; 2006-01-01; 2006-01-01 ; Conference date: 01-01-2006 Through 01-01-2006",
year = "2006",
month = jan,
day = "1",
doi = "10.1007/11922155_5",
language = "English",
isbn = "978-3-540-48887-3",
series = "Lecture Notes in Computer Science",
publisher = "Springer, Berlin, Heidelberg",
pages = "57–72",
editor = "Herik, {H.J. van den} and Y.S-C. Hsu and T-s. Hsu and H.H.L.M. Donkers",
booktitle = "Advances in Computer Games. ACG 2005",
address = "Germany",
}