Skip to main content
Springer Nature Link
Log in

Similarity Pruning in PrOM Search

  • Conference paper
Advances in Computer Games (ACG 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4250))

Included in the following conference series:

  • 872 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Carmel, D., Markovitch, S.: Learning and Using Opponent Models in Adversary Search. Technical Report CIS9609, Technion, Haifa, Israel (1996)

    Google Scholar 

  2. Carmel, D., Markovitch, S.: Pruning Algorithms for Multi-Model Adversary Search. Artificial Intelligence 99(2), 325–355 (1998)

    Article  MATH  Google Scholar 

  3. Donkers, H.H.L.M.: Nosce Hostem: Searching with Opponent Models. PhD thesis, Universiteit Maastricht. Universitaire Pers Maastricht, Maastricht, The Netherlands (2003)

    Google Scholar 

  4. Donkers, H.H.L.M., Uiterwijk, J.W.H.M., van den Herik, H.J.: Probabilistic Opponent-Model Search. Information Sciences 135(3–4), 123–149 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Donkers, H.H.L.M., van den Herik, H.J., Uiterwijk, J.W.H.M.: Probabilistic Opponent-Model Search in Bao. In: Rauterberg, M. (ed.) ICEC 2004. LNCS, vol. 3166, pp. 409–419. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  6. Iida, H., Uiterwijk, J.W.H.M., van den Herik, H.J., Herschberg, I.S.: Potential Applications of Opponent-Model Search. Part 1: the Domain of Applicability. ICCA Journal 16(4), 201–208 (1993)

    Google Scholar 

  7. Korf, R.E.: Multi-Player Alpha-Beta Pruning. Artificial Intelligence 48(1), 99–111 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  8. Luckhardt, C.A., Irani, K.B.: An Algorithmic Solution of n-Person Games. In: Proceedings AAAI 1986, pp. 158–162 (1986)

    Google Scholar 

  9. Matsumoto, M., Nishimura, T.: Mersenne Twister: A 623-Dimensionally Equidistributed Uniform Pseudorandom Number Generator. ACM Transactions on Modeling and Computer Simulation 7(1), 3–30 (1998)

    Article  Google Scholar 

  10. Newborn, M.M.: The Efficiency of the Alpha-Beta Search on Trees with Branch-Dependent Terminal Node Scores. Artificial Intelligence 87(1-2), 225–293 (1977)

    MathSciNet  Google Scholar 

  11. Sturtevant, N.R.: Last-Branch and Speculative Pruning Algorithms for Maxn. In: Proceedings IJCAI 2003, pp. 669–678 (2003)

    Google Scholar 

  12. Sturtevant, N.R., Korf, R.E.: On Pruning Techniques for Multi-Player Games. In: Proceedings of AAAI 2000, pp. 201–208 (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Knowledge and Agent Technology, MICC, Universiteit Maastricht, Maastricht, The Netherlands

    H. (Jeroen) H. L. M. Donkers, H. Jaap van den Herik & Jos W. H. M. Uiterwijk

Authors
  1. H. (Jeroen) H. L. M. Donkers
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Jaap van den Herik
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jos W. H. M. Uiterwijk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Games and AI Group, MICC, Faculty of Humanities and Sciences, Universiteit Maastricht, Maastricht, The Netherlands

    H. Jaap van den Herik

  2. Department of Information Management, Chang Jung Christian University, Tainan

    Shun-Chin Hsu

  3. Institute of Information Science, Academia Sinica, Taipei,  

    Tsan-sheng Hsu

  4. Institute for Knowledge and Agent Technology, MICC, Universiteit Maastricht, Maastricht, The Netherlands

    H. H. L. M. (Jeroen) Donkers

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Donkers, H.(.H.L.M., van den Herik, H.J., Uiterwijk, J.W.H.M. (2006). Similarity Pruning in PrOM Search. In: van den Herik, H.J., Hsu, SC., Hsu, Ts., Donkers, H.H.L.M.(. (eds) Advances in Computer Games. ACG 2005. Lecture Notes in Computer Science, vol 4250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11922155_5

Download citation

  • DOI: https://doi.org/10.1007/11922155_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48887-3

  • Online ISBN: 978-3-540-48889-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics