Skip to main content
SpringerLink
Log in

A Solution to the GHI Problem for Best-First Search

  • Conference paper
  • First Online:
Computers and Games (CG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1558))

Included in the following conference series:

Abstract

In a search graph a node’s value may be dependent on the path leading to it. Different paths may lead to different values. Hence, it is difficult to determine the value of any node unambiguously. The problem is known as the graph-history-interaction (GHI) problem. This paper provides a solution for best-first search. First, we give a precise formulation of the problem. Then, for best-first search and for other searches, we review earlier proposals to overcome the problem. Next, our solution is given in detail. Here we introduce the notion of twin nodes, enabling a distinction of nodes according to their history. The implementation, called BTA (Base-Twin Algorithm), is performed for pn search, a best-first search algorithm. It is generally applicable to other best-first search algorithms. Experimental results in the field of computer chess confirm the claim that the GHI problem has been solved for best-first search.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L.V. Allis, M. van der Meulen, and H.J. van den Herik. Proof-Number Search. Artificial Intelligence, 66(1):91–124, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  2. L.V. Allis. Searching for Solutions in Games and Artificial Intelligence. Ph.D. thesis, University of Limburg, Maastricht, The Netherlands, 1994.

    Google Scholar 

  3. E.B. Baum and W.D. Smith. Best Play for Imperfect Players and Game Tree Search. Submitted to Artificial Intelligence.

    Google Scholar 

  4. H.J. Berliner and C. McConnell. B* Probability Based Search. Artificial Intelligence, 86(1):97–156, 1996.

    Article  Google Scholar 

  5. D.M. Breuker, L.V. Allis, and H.J. van den Herik. How to Mate: Applying Proof-Number Search. In H.J. van den Herik, I.S. Herschberg, and J.W.H.M. Uiterwijk, editors, Advances in Computer Chess 7, pages 251–272, Maastricht, The Netherlands, 1994. University of Limburg.

    Google Scholar 

  6. D.M. Breuker, H.J. van den Herik, L.V. Allis, and J.W.H.M. Uiterwijk. A Solution to the GHI Problem for Best-First Search. Technical Report #CS 97-02, Computer Science Department, Universiteit Maastricht, Maastricht, The Netherlands, 1997.

    Google Scholar 

  7. D.M. Breuker. Memory versus Search in Games. Ph.D. thesis, Universiteit Maastricht, The Netherlands, 1998.

    Google Scholar 

  8. M. Campbell. The Graph-History Interaction: On Ignoring Position History. In 1985 Association for Computing Machinery Annual Conference, pages 278–280, 1985.

    Google Scholar 

  9. R.M. Hyatt, A.E. Gower, and H.L. Nelson. Cray Blitz. In D.F. Beal, editor, Advances in Computer Chess 4, pages 8–18, Oxford, United Kingdom, 1984. Pergamon Press.

    Google Scholar 

  10. B. Kaйzić, R. Keene, and K.A. Lim. The Official Laws of Chess and Other FIDE Regulations. B.T. Batsford Ltd., London, United Kingdom, 1985.

    Google Scholar 

  11. T. Krabbé. Chess Curiosities. George Allen and Unwin Ltd., London, United Kingdom, 1985.

    Google Scholar 

  12. T.A. Marsland. A Review of Game-Tree Pruning. ICCA Journal, 9(1):3–19, 1986.

    Google Scholar 

  13. A.J. Palay. Searching with Probabilities. Ph.D. thesis, Boston University, Boston MA, USA, 1985.

    MATH  Google Scholar 

  14. A. Plaat, J. Schaeffer, W. Pijls, and A. de Bruin. Best-First Fixed-Depth Minimax Algorithms. Artificial Intelligence, 87(2):255–293, 1996.

    Article  MathSciNet  Google Scholar 

  15. F. Reinfeld. Win at Chess. Dover Publications Inc., New York NY, USA, 1958. Originally published (1945) as Chess Quiz by David McKay Company, New York NY, USA.

    Google Scholar 

  16. M. Schijf. Proof-Number Search and Transpositions. M.Sc. thesis, University of Leiden, Leiden, The Netherlands, 1993.

    Google Scholar 

  17. M. Schijf, L.V. Allis, and J.W.H.M. Uiterwijk. Proof-Number Search and Transpositions. ICCA Journal, 17(2):63–74, 1994.

    Google Scholar 

  18. G. Stockman. A Minimax Algorithm Better than Alpha-beta? Artificial Intelligence, 12:179–196, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  19. K. Thompson. Personal communication, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Universiteit Maastricht, P.O. Box 616, 6200, MD Maastricht, The Netherlands

    Dennis M. Breuker, H. Jaap van den Herik & Jos W. H. M. Uiterwijk

  2. Quintiq B.V., Van Grobbendoncklaan 83, 5213, AV’ s Hertogenbosch, The Netherlands

    L. Victor Allis

Authors
  1. Dennis M. Breuker
    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

  4. L. Victor Allis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Maastricht, Maastricht, The Netherlands

    H. Jaap van den Herik

  2. Department of Computer Science, Shizuoka University, Hamamatsu, Japan

    Hiroyuki Iida

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Breuker, D.M., van den Herik, H.J., Uiterwijk, J.W.H.M., Allis, L.V. (1999). A Solution to the GHI Problem for Best-First Search. In: van den Herik, H.J., Iida, H. (eds) Computers and Games. CG 1998. Lecture Notes in Computer Science, vol 1558. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48957-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-48957-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65766-8

  • Online ISBN: 978-3-540-48957-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation