Similarity pruning in PrOM search

H.H.L.M. Donkers*, H.J. van den Herik, J.W.H.M. Uiterwijk

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingAcademicpeer-review


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.
Original languageEnglish
Title of host publicationAdvances in Computer Games. ACG 2005
EditorsH.J. van den Herik, Y.S-C. Hsu, T-s. Hsu, H.H.L.M. Donkers
PublisherSpringer, Berlin, Heidelberg
ISBN (Electronic)978-3-540-48889-7
ISBN (Print)978-3-540-48887-3
Publication statusPublished - 1 Jan 2006
Eventconference; 2006-01-01; 2006-01-01 -
Duration: 1 Jan 20061 Jan 2006

Publication series

SeriesLecture Notes in Computer Science


Conferenceconference; 2006-01-01; 2006-01-01

Cite this