Skip to main content
SpringerLink
Log in

Remarks on History and Presence of Game Tree Search and Research

  • Chapter
Information Theory, Combinatorics, and Search Theory

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

  • 2168 Accesses

Abstract

One hundred years ago, in 1912 game tree search was introduced as a scientific field by Ernst Zermelo in a concise 4-page paper. Almost four decades later the first computers were there, and three more or less concrete proposals for a Chess computer program were made by Norbert Wiener, Claude Shannon, and Alan Turing. After a long march of craftsmanship, in 1997 computer Deep Blue beat the best human Chess player in a match with six games.

The other big classic in the world of games is Go from Asia. The approach from computer Chess does not work in Go. But in 2006 a Monte Carlo tree search procedure became the starting point of a triumph march. Within the following six years computer Go programs have reached a level near to that of the best western amateur players. Also in other games like Havannah, Monte Carlo search led to tremendous progress in computer playing strength.

We describe the origins of game tree search in the early 20th century and discuss some of the waves of progress. With the help of C. Donninger we also meditate about the twilight role of science and scientific research for progress in game programming.

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

Access this chapter

Log in via an institution
eBook
USD 16.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. Abramson, B.: Expected-outcome: a general model of static evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence 12, 182–193 (1990)

    Article  Google Scholar 

  2. Althöfer, I., Leader, I.: Correlation of Boolean functions and pathology in recursion trees. SIAM Journal of Discrete Mathematics 8, 526–535 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  3. Althöfer, I.: Das Dreihirn - Entscheidungsteilung im Schach. Magazine “ComputerSchach und Spiele”, 20–22 (December 1985) (text in German); translation of the title is “The Triple-Brain - decision sharing in Chess”

    Google Scholar 

  4. Althöfer, I.: Computer-aided game inventing. Technical report, FSU Jena, Fakultät Mathematik und Informatik (2003), http://www.minet.uni-jena.de/preprints/althoefer_03/CAGI.pdf

  5. Althöfer, I., de Koning, J., Lieberum, J., Meyer-Kahlen, S., Rolle, T., Sameith, J.: Five visualisations of the k-best mode. ICGA Journal 12, 182–189 (2003), An extended version with examples from Go is available online at http://www.althofer.de/k-best-visualisations.html

    Google Scholar 

  6. Althöfer, I.: Improved game play by multiple computer hints. Theoretical Computer Science 313, 315–324 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  7. Althöfer, I.: On games with random-turn order and Monte-Carlo perfectness. ICGA Journal 34, 179–190 (2011)

    Article  Google Scholar 

  8. Althöfer, I.: On the histories of board game Havannah and computer Havannah. ICGA Journal 35 (2012)

    Google Scholar 

  9. Althöfer, I.: Shannon engine and Turing engine in an exhibition match. Submitted to ICGA Journal (2012), Preliminary version online available at http://www.althofer.de/shannon-turing-exhibition-match.pdf

  10. Amazons at the Computer Olympiads, list of results online at http://www.grappa.univ-lille3.fr/icga/game.php?id=15

  11. Baudis, P.: Balancing MCTS by dynamically adjusting komi value. ICGA Journal 34, 131–139 (2011)

    Article  Google Scholar 

  12. Bleicher, E., Althöfer, I.: Retrograde analysis of the chess endgame with king plus queen versus king plus rook on mxn boards, results available online at http://www.althofer.de/chess-kq-kr.pdf

  13. Berlekamp, E., Conway, J.H., Guy, R.: Winning ways for your mathematical play. Academic Press, New York (1982)

    MATH  Google Scholar 

  14. Bellman, R.: On the application of dynamic programming to the determination of optimal play in Chess and checkers. Proc. Nat. Academy of Sciences of the USA 53, 244–246 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  15. Bleicher, E.: Analysis tool freezer for chess endgames, Commercially available since (2003), http://www.shredderchess.com/chess-program/freezer.html

  16. Bleicher, E.: Building chess endgame databases for positions with many pieces using a-priori information. Technical Report, FSU Jena, Fakultaet Mathematik und Informatik (2004), http://www.minet.uni-jena.de/preprints/bleicher_04/FREEZER_.PDF

  17. Browne, C.: Automated generation and evaluation of recombination games. Ph.D. Thesis (2008), http://www.cameronius.com/

  18. Bruegmann, B.: Monte Carlo Go, Report, not offiially published (1993), http://www.althofer.de/Bruegmann-MonteCarloGo.pdf

  19. Berlekamp, E., Wolfe, D.: Mathematical Go - Chilling Gets the Last Point. A.K. Peters/CRC Press (1997)

    Google Scholar 

  20. O. Cordel, Theorie und Praxis des Schachspiels, II. Band, A. Stein’s Verlagsbuchhandlung, Potsdam, scan of page 302 (1913), http://www.althofer.de/cordel-p302.jpg

  21. Ciura, M., Ewalds, T.: The Havannah prize match 2012 from programmer’s perspective. ICGA Journal 35 (2012)

    Google Scholar 

  22. Coulom, R.: Efficient Selectivity and Backup Operators in Monte-Carlo Tree Search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol. 4630, pp. 72–83. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  23. Donninger, C.: Null move and deep search: Selective-search heuristics for obtuse chess programs. ICCA Journal 16, 137–143 (1993)

    Google Scholar 

  24. Feist, M., Thompson, K.: The Turing engine (2007), description, engine and Turing Text from 1953 available online at http://www.chessbase.de/spotlight/spotlight2.asp?id=15

  25. Feist, M.: The Shannon engine (2009), description and engine for download online at http://www.chessbase.de/nachrichten.asp?newsid=9711

  26. Fischer, T.: Exakte Analyse von Heuristiken fuer kombinatorische Spiele. Doctoral dissertation, Fakultaet Mathematik und Informatik, FSU Jena (2011), http://www.althofer.de/dissertation_thomas-fischer.pdf

  27. Fraenkel, A.S., Lichtenstein, D.: Computing a Perfect Strategy for nxn Chess Requires Time Exponential in N. In: Even, S., Kariv, O. (eds.) ICALP 1981. LNCS, vol. 115, pp. 278–293. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  28. Gasser, R.: Harnessing computational resources for efficient exhaustive search. Doctoral dissertation, ETH Zurich (1994)

    Google Scholar 

  29. Gasser, R.: Solving Nine Men’s Morris. In: Nowakowski, R.J. (ed.) Games of No Chance. Cambridge University Press (1998), http://library.msri.org/books/Book29/files/gasser.pdf

  30. Garey, M.R., Johnson, D.S.: Computers and intractability - a guide to the theory of NP- completeness. Freeman (1979)

    Google Scholar 

  31. de Groot, A.: Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam (1946)

    Google Scholar 

  32. Game Havannah at the Computer Olympiads, List of results online at http://www.grappa.univ-lille3.fr/icga/game.php?id=37

  33. Heinz, E.A.: Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths. Vieweg, Braunschweig (2000)

    Book  Google Scholar 

  34. Game Hex at the Computer Olympiads, List of results online at http://www.grappa.univ-lille3.fr/icga/game.php?id=7

  35. Hsu, F.-H.: Behind Deep Blue - Building the Computer that Defeated the World Chess Champion. Princeton University Press (2002)

    Google Scholar 

  36. Klein, F.: Handwritten seminar protocols for the period 1872-1912, scans available online at http://www.uni-math.gwdg.de/aufzeichnungen/klein-scans/

  37. Klein, F.: Transcript of [36] for the winter semester 1909-1910, http://www.uni-bielefeld.de/idm/arge/klein29_cst.pdf

  38. Kocsis, L., Szepesvári, C.: Bandit Based Monte-Carlo Planning. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282–293. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  39. Krabbenbos, J., van der Valk, T.: Report on the Havannah prize match 2012. ICGA Journal 35 (2012)

    Google Scholar 

  40. Lasker, E.: Kampf (Struggle) (2001) (reprint), available at Lasker Society http://www.lasker-gesellschaft.de/publikationen/emanuel-lasker-kampf/kampf.html (1907)

  41. Lasker, E.: Brettspiele der Völker, Berlin (1931)

    Google Scholar 

  42. Leonard, R.: Von Neumann, Morgenstern and the creation of game theory: from chess to social science, 1900-1960. Cambridge University Press (2010)

    Google Scholar 

  43. Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. Journal of the ACM 27, 393–401 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  44. Nau, D.S.: An investigation of the causes of pathology in games. Artifical Intelligence 19, 257–278 (1982)

    Article  MATH  Google Scholar 

  45. Pearl, J.: Heuristics - Intelligent Search Strategies for Computer Problem Solving. Adison-Wesley (1984)

    Google Scholar 

  46. Peres, Y., Schramm, O., Sheffield, S., Wilson, D.B.: Random-turn Hex and other selection games. American Mathematical Monthly 114, 373–387 (2007)

    MathSciNet  MATH  Google Scholar 

  47. Randell, B.: From analytical engine to electronic digital computer: the contributions of Ludgate, Torres, and Bush. Annals of the History of Computing 4, 327–341 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  48. Randell, B.: The Origins of Digital Computers, 3rd edn. Springer (1982)

    Google Scholar 

  49. Reisch, S.: Hex ist PSPACE-vollständig (Hex is PSPACE-complete). Acta Informatica 15, 167–191 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  50. Robson, J.M.: The complexity of Go. In: Proceedings of the IFIP 9th World Computer Congress on Information Processing, pp. 413–417 (1983)

    Google Scholar 

  51. Robson, J.M.: Combinatorial games with exponential space complete decision problems. In: Proceedings of the Mathematical Foundations of Computer Science 1984, pp. 498–506. Springer, London (1984)

    Chapter  Google Scholar 

  52. Schaeffer, J., Burch, N., Björnsson, Y., Kishimoto, A., Müller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317, 1518–1522 (2007)

    Google Scholar 

  53. Schaeffer, J.: One Jump Ahead - Challenging Human Supremacy in Checkers. Springer, New York (1997)

    Book  Google Scholar 

  54. Schäfer, A.: Rock’n’Roll - a cross-platform engine for the board game ‘EinStein würfelt nicht’, http://www.minet.uni-jena.de/preprints/althoefer_06/rockNroll.pdf

  55. Schreiber, L.: The generalized cordel property in discrete optimization. Doctoral dissertation, Fakultaet Mathematik und Informatik, FSU Jena (2012), http://www.althofer.de/thesis-schreiber.pdf

  56. Schrüfer, G.: Presence and absence of pathology on game trees. In: Beal, D.F. (ed.) Advances in Computer Chess, vol. 4, pp. 101–112. Pergamon (1986)

    Google Scholar 

  57. Sedgewick, R.: Algorithms for the masses, http://www.cs.princeton.edu/~rs/talks/AlgsMasses.pdf

  58. Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine, 7th series 41(314), 256–275 (1950)

    Article  MathSciNet  MATH  Google Scholar 

  59. Sheppard, B.: Towards perfect play of Scrabble. Doctoral dissertation, University of Maastricht (2002)

    Google Scholar 

  60. Stahlhacke, P.: Verification of Gasser’s analysis of Nine Men’s Morris. Personal Communication (1999)

    Google Scholar 

  61. Stahlhacke, P.: The game of Lasker Morris. Technical Report, FSU Jena (2003), http://www.althofer.de/stahlhacke-lasker-morris-2003.pdf

  62. Ströhlein, T.: Untersuchungen kombinatorischer Spiele. Doctoral dissertation, TU Munich (1970)

    Google Scholar 

  63. Tarrasch, S.: Das Schachspiel, Deutsche Buchgemeinschaft (1931)

    Google Scholar 

  64. Turing, A.M.: Chess. In: Bowden, B.V. (ed.) Faster Than Thought, pp. 286–295. Pitman, London (1953)

    Google Scholar 

  65. Wedd, N.: List of human-computer Go exhibition games (since 1986), http://www.computer-go.info/h-c/index.html

  66. Wiener, N.: Cybernetics, or control and communication in the animal and the machine. Wiley (1948)

    Google Scholar 

  67. Zermelo, E.: Beweis, da jede Menge wohlgeordnet werden kann. Mathematische Annalen 59, 514–516 (1904)

    Article  MathSciNet  MATH  Google Scholar 

  68. Zermelo, E.: Ueber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In: Proceedings of the Fifth International Congress of Mathematicians, pp. 501–504. Cambridge University Press (1913)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Mathematik und Informatik, Friedrich-Schiller-Universität Jena, 07737, Jena, Germany

    Ingo Althöfer

Authors
  1. Ingo Althöfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Bielefeld, Universitätsstr. 25, 33615, Bielefeld, Germany

    Harout Aydinian  & Christian Deppe  & 

  2. Department of Computer Science, University of Salerno, via Ponte don Melillo, 84084, Fisciano, Italy

    Ferdinando Cicalese

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Althöfer, I. (2013). Remarks on History and Presence of Game Tree Search and Research. In: Aydinian, H., Cicalese, F., Deppe, C. (eds) Information Theory, Combinatorics, and Search Theory. Lecture Notes in Computer Science, vol 7777. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-36899-8_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-36899-8_34

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-36898-1

  • Online ISBN: 978-3-642-36899-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation