{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:29:50Z","timestamp":1742930990518,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":68,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642368981"},{"type":"electronic","value":"9783642368998"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36899-8_34","type":"book-chapter","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T01:33:37Z","timestamp":1362447217000},"page":"677-693","source":"Crossref","is-referenced-by-count":0,"title":["Remarks on History and Presence of Game Tree Search and Research"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/34.44404","volume":"12","author":"B. Abramson","year":"1990","unstructured":"Abramson, B.: Expected-outcome: a general model of static evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a012, 182\u2013193 (1990)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"34_CR2","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1137\/S0895480192240470","volume":"8","author":"I. Alth\u00f6fer","year":"1995","unstructured":"Alth\u00f6fer, I., Leader, I.: Correlation of Boolean functions and pathology in recursion trees. SIAM Journal of Discrete Mathematics\u00a08, 526\u2013535 (1995)","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"34_CR3","unstructured":"Alth\u00f6fer, I.: Das Dreihirn - Entscheidungsteilung im Schach. Magazine \u201cComputerSchach und Spiele\u201d, 20\u201322 (December 1985) (text in German); translation of the title is \u201cThe Triple-Brain - decision sharing in Chess\u201d"},{"key":"34_CR4","unstructured":"Alth\u00f6fer, I.: Computer-aided game inventing. Technical report, FSU Jena, Fakult\u00e4t Mathematik und Informatik (2003), \n                    \n                      http:\/\/www.minet.uni-jena.de\/preprints\/althoefer_03\/CAGI.pdf"},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"182","DOI":"10.3233\/ICG-2003-26304","volume":"12","author":"I. Alth\u00f6fer","year":"2003","unstructured":"Alth\u00f6fer, I., de Koning, J., Lieberum, J., Meyer-Kahlen, S., Rolle, T., Sameith, J.: Five visualisations of the k-best mode. ICGA Journal\u00a012, 182\u2013189 (2003), An extended version with examples from Go is available online at \n                    \n                      http:\/\/www.althofer.de\/k-best-visualisations.html","journal-title":"ICGA Journal"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2003.08.012","volume":"313","author":"I. Alth\u00f6fer","year":"2004","unstructured":"Alth\u00f6fer, I.: Improved game play by multiple computer hints. Theoretical Computer Science\u00a0313, 315\u2013324 (2004)","journal-title":"Theoretical Computer Science"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"179","DOI":"10.3233\/ICG-2011-34402","volume":"34","author":"I. Alth\u00f6fer","year":"2011","unstructured":"Alth\u00f6fer, I.: On games with random-turn order and Monte-Carlo perfectness. ICGA Journal\u00a034, 179\u2013190 (2011)","journal-title":"ICGA Journal"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Alth\u00f6fer, I.: On the histories of board game Havannah and computer Havannah. ICGA Journal\u00a035 (2012)","DOI":"10.3233\/ICG-2012-35404"},{"key":"34_CR9","unstructured":"Alth\u00f6fer, I.: Shannon engine and Turing engine in an exhibition match. Submitted to ICGA Journal (2012), Preliminary version online available at \n                    \n                      http:\/\/www.althofer.de\/shannon-turing-exhibition-match.pdf"},{"key":"34_CR10","unstructured":"Amazons at the Computer Olympiads, list of results online at \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/icga\/game.php?id=15"},{"key":"34_CR11","doi-asserted-by":"publisher","first-page":"131","DOI":"10.3233\/ICG-2011-34302","volume":"34","author":"P. Baudis","year":"2011","unstructured":"Baudis, P.: Balancing MCTS by dynamically adjusting komi value. ICGA Journal\u00a034, 131\u2013139 (2011)","journal-title":"ICGA Journal"},{"key":"34_CR12","unstructured":"Bleicher, E., Alth\u00f6fer, I.: Retrograde analysis of the chess endgame with king plus queen versus king plus rook on mxn boards, results available online at \n                    \n                      http:\/\/www.althofer.de\/chess-kq-kr.pdf"},{"key":"34_CR13","volume-title":"Winning ways for your mathematical play","author":"E. Berlekamp","year":"1982","unstructured":"Berlekamp, E., Conway, J.H., Guy, R.: Winning ways for your mathematical play. Academic Press, New York (1982)"},{"key":"34_CR14","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1073\/pnas.53.2.244","volume":"53","author":"R. Bellman","year":"1965","unstructured":"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\u00a053, 244\u2013246 (1965)","journal-title":"Proc. Nat. Academy of Sciences of the USA"},{"key":"34_CR15","unstructured":"Bleicher, E.: Analysis tool freezer for chess endgames, Commercially available since (2003), \n                    \n                      http:\/\/www.shredderchess.com\/chess-program\/freezer.html"},{"key":"34_CR16","unstructured":"Bleicher, E.: Building chess endgame databases for positions with many pieces using a-priori information. Technical Report, FSU Jena, Fakultaet Mathematik und Informatik (2004), \n                    \n                      http:\/\/www.minet.uni-jena.de\/preprints\/bleicher_04\/FREEZER_.PDF"},{"key":"34_CR17","unstructured":"Browne, C.: Automated generation and evaluation of recombination games. Ph.D. Thesis (2008), \n                    \n                      http:\/\/www.cameronius.com\/"},{"key":"34_CR18","unstructured":"Bruegmann, B.: Monte Carlo Go, Report, not offiially published (1993), \n                    \n                      http:\/\/www.althofer.de\/Bruegmann-MonteCarloGo.pdf"},{"key":"34_CR19","unstructured":"Berlekamp, E., Wolfe, D.: Mathematical Go - Chilling Gets the Last Point. A.K. Peters\/CRC Press (1997)"},{"key":"34_CR20","unstructured":"O. Cordel, Theorie und Praxis des Schachspiels, II. Band, A. Stein\u2019s Verlagsbuchhandlung, Potsdam, scan of page 302 (1913), \n                    \n                      http:\/\/www.althofer.de\/cordel-p302.jpg"},{"key":"34_CR21","unstructured":"Ciura, M., Ewalds, T.: The Havannah prize match 2012 from programmer\u2019s perspective. ICGA Journal\u00a035 (2012)"},{"key":"34_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"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.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"34_CR23","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"Donninger, C.: Null move and deep search: Selective-search heuristics for obtuse chess programs. ICCA Journal\u00a016, 137\u2013143 (1993)","journal-title":"ICCA Journal"},{"key":"34_CR24","unstructured":"Feist, M., Thompson, K.: The Turing engine (2007), description, engine and Turing Text from 1953 available online at \n                    \n                      http:\/\/www.chessbase.de\/spotlight\/spotlight2.asp?id=15"},{"key":"34_CR25","unstructured":"Feist, M.: The Shannon engine (2009), description and engine for download online at \n                    \n                      http:\/\/www.chessbase.de\/nachrichten.asp?newsid=9711"},{"key":"34_CR26","unstructured":"Fischer, T.: Exakte Analyse von Heuristiken fuer kombinatorische Spiele. Doctoral dissertation, Fakultaet Mathematik und Informatik, FSU Jena (2011), \n                    \n                      http:\/\/www.althofer.de\/dissertation_thomas-fischer.pdf"},{"key":"34_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-10843-2_23","volume-title":"Automata, Languages and Programming","author":"A.S. Fraenkel","year":"1981","unstructured":"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.\u00a0115, pp. 278\u2013293. Springer, Heidelberg (1981)"},{"key":"34_CR28","unstructured":"Gasser, R.: Harnessing computational resources for efficient exhaustive search. Doctoral dissertation, ETH Zurich (1994)"},{"key":"34_CR29","unstructured":"Gasser, R.: Solving Nine Men\u2019s Morris. In: Nowakowski, R.J. (ed.) Games of No Chance. Cambridge University Press (1998), \n                    \n                      http:\/\/library.msri.org\/books\/Book29\/files\/gasser.pdf"},{"key":"34_CR30","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability - a guide to the theory of NP- completeness. Freeman (1979)"},{"key":"34_CR31","unstructured":"de Groot, A.: Het denken van den Schaker, een experimenteel-psychologische studie. Ph.D. thesis, University of Amsterdam (1946)"},{"key":"34_CR32","unstructured":"Game Havannah at the Computer Olympiads, List of results online at \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/icga\/game.php?id=37"},{"key":"34_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-322-90178-1","volume-title":"Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths","author":"E.A. Heinz","year":"2000","unstructured":"Heinz, E.A.: Scalable Search in Computer Chess: Algorithmic Enhancements and Experiments at High Search Depths. Vieweg, Braunschweig (2000)"},{"key":"34_CR34","unstructured":"Game Hex at the Computer Olympiads, List of results online at \n                    \n                      http:\/\/www.grappa.univ-lille3.fr\/icga\/game.php?id=7"},{"key":"34_CR35","unstructured":"Hsu, F.-H.: Behind Deep Blue - Building the Computer that Defeated the World Chess Champion. Princeton University Press (2002)"},{"key":"34_CR36","unstructured":"Klein, F.: Handwritten seminar protocols for the period 1872-1912, scans available online at \n                    \n                      http:\/\/www.uni-math.gwdg.de\/aufzeichnungen\/klein-scans\/"},{"key":"34_CR37","unstructured":"Klein, F.: Transcript of [36] for the winter semester 1909-1910, \n                    \n                      http:\/\/www.uni-bielefeld.de\/idm\/arge\/klein29_cst.pdf"},{"key":"34_CR38","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit Based Monte-Carlo Planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"key":"34_CR39","doi-asserted-by":"crossref","unstructured":"Krabbenbos, J., van der Valk, T.: Report on the Havannah prize match 2012. ICGA Journal\u00a035 (2012)","DOI":"10.3233\/ICG-2012-35413"},{"key":"34_CR40","unstructured":"Lasker, E.: Kampf (Struggle) (2001) (reprint), available at Lasker Society \n                    \n                      http:\/\/www.lasker-gesellschaft.de\/publikationen\/emanuel-lasker-kampf\/kampf.html\n                    \n                    \n                   (1907)"},{"key":"34_CR41","unstructured":"Lasker, E.: Brettspiele der V\u00f6lker, Berlin (1931)"},{"key":"34_CR42","doi-asserted-by":"crossref","unstructured":"Leonard, R.: Von Neumann, Morgenstern and the creation of game theory: from chess to social science, 1900-1960. Cambridge University Press (2010)","DOI":"10.1017\/CBO9780511778278"},{"key":"34_CR43","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1145\/322186.322201","volume":"27","author":"D. Lichtenstein","year":"1980","unstructured":"Lichtenstein, D., Sipser, M.: Go is polynomial-space hard. Journal of the ACM\u00a027, 393\u2013401 (1980)","journal-title":"Journal of the ACM"},{"key":"34_CR44","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/0004-3702(82)90002-9","volume":"19","author":"D.S. Nau","year":"1982","unstructured":"Nau, D.S.: An investigation of the causes of pathology in games. Artifical Intelligence\u00a019, 257\u2013278 (1982)","journal-title":"Artifical Intelligence"},{"key":"34_CR45","unstructured":"Pearl, J.: Heuristics - Intelligent Search Strategies for Computer Problem Solving. Adison-Wesley (1984)"},{"key":"34_CR46","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/00029890.2007.11920428","volume":"114","author":"Y. Peres","year":"2007","unstructured":"Peres, Y., Schramm, O., Sheffield, S., Wilson, D.B.: Random-turn Hex and other selection games. American Mathematical Monthly\u00a0114, 373\u2013387 (2007)","journal-title":"American Mathematical Monthly"},{"key":"34_CR47","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1109\/MAHC.1982.10042","volume":"4","author":"B. Randell","year":"1982","unstructured":"Randell, B.: From analytical engine to electronic digital computer: the contributions of Ludgate, Torres, and Bush. Annals of the History of Computing\u00a04, 327\u2013341 (1982)","journal-title":"Annals of the History of Computing"},{"key":"34_CR48","doi-asserted-by":"crossref","unstructured":"Randell, B.: The Origins of Digital Computers, 3rd edn. Springer (1982)","DOI":"10.1007\/978-3-642-61812-3"},{"key":"34_CR49","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00288964","volume":"15","author":"S. Reisch","year":"1981","unstructured":"Reisch, S.: Hex ist PSPACE-vollst\u00e4ndig (Hex is PSPACE-complete). Acta Informatica\u00a015, 167\u2013191 (1981)","journal-title":"Acta Informatica"},{"key":"34_CR50","unstructured":"Robson, J.M.: The complexity of Go. In: Proceedings of the IFIP 9th World Computer Congress on Information Processing, pp. 413\u2013417 (1983)"},{"key":"34_CR51","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/BFb0030333","volume-title":"Proceedings of the Mathematical Foundations of Computer Science 1984","author":"J.M. Robson","year":"1984","unstructured":"Robson, J.M.: Combinatorial games with exponential space complete decision problems. In: Proceedings of the Mathematical Foundations of Computer Science 1984, pp. 498\u2013506. Springer, London (1984)"},{"key":"34_CR52","doi-asserted-by":"crossref","unstructured":"Schaeffer, J., Burch, N., Bj\u00f6rnsson, Y., Kishimoto, A., M\u00fcller, M., Lake, R., Lu, P., Sutphen, S.: Checkers is solved. Science 317, 1518\u20131522 (2007)","DOI":"10.1126\/science.1144079"},{"key":"34_CR53","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2733-3","volume-title":"One Jump Ahead - Challenging Human Supremacy in Checkers","author":"J. Schaeffer","year":"1997","unstructured":"Schaeffer, J.: One Jump Ahead - Challenging Human Supremacy in Checkers. Springer, New York (1997)"},{"key":"34_CR54","unstructured":"Sch\u00e4fer, A.: Rock\u2019n\u2019Roll - a cross-platform engine for the board game \u2018EinStein w\u00fcrfelt nicht\u2019, \n                    \n                      http:\/\/www.minet.uni-jena.de\/preprints\/althoefer_06\/rockNroll.pdf"},{"key":"34_CR55","unstructured":"Schreiber, L.: The generalized cordel property in discrete optimization. Doctoral dissertation, Fakultaet Mathematik und Informatik, FSU Jena (2012), \n                    \n                      http:\/\/www.althofer.de\/thesis-schreiber.pdf"},{"key":"34_CR56","unstructured":"Schr\u00fcfer, G.: Presence and absence of pathology on game trees. In: Beal, D.F. (ed.) Advances in Computer Chess, vol.\u00a04, pp. 101\u2013112. Pergamon (1986)"},{"key":"34_CR57","unstructured":"Sedgewick, R.: Algorithms for the masses, \n                    \n                      http:\/\/www.cs.princeton.edu\/~rs\/talks\/AlgsMasses.pdf"},{"issue":"314","key":"34_CR58","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine, 7th series\u00a041(314), 256\u2013275 (1950)","journal-title":"Philosophical Magazine, 7th series"},{"key":"34_CR59","unstructured":"Sheppard, B.: Towards perfect play of Scrabble. Doctoral dissertation, University of Maastricht (2002)"},{"key":"34_CR60","unstructured":"Stahlhacke, P.: Verification of Gasser\u2019s analysis of Nine Men\u2019s Morris. Personal Communication (1999)"},{"key":"34_CR61","unstructured":"Stahlhacke, P.: The game of Lasker Morris. Technical Report, FSU Jena (2003), \n                    \n                      http:\/\/www.althofer.de\/stahlhacke-lasker-morris-2003.pdf"},{"key":"34_CR62","unstructured":"Str\u00f6hlein, T.: Untersuchungen kombinatorischer Spiele. Doctoral dissertation, TU Munich (1970)"},{"key":"34_CR63","unstructured":"Tarrasch, S.: Das Schachspiel, Deutsche Buchgemeinschaft (1931)"},{"key":"34_CR64","first-page":"286","volume-title":"Faster Than Thought","author":"A.M. Turing","year":"1953","unstructured":"Turing, A.M.: Chess. In: Bowden, B.V. (ed.) Faster Than Thought, pp. 286\u2013295. Pitman, London (1953)"},{"key":"34_CR65","unstructured":"Wedd, N.: List of human-computer Go exhibition games (since 1986), \n                    \n                      http:\/\/www.computer-go.info\/h-c\/index.html"},{"key":"34_CR66","unstructured":"Wiener, N.: Cybernetics, or control and communication in the animal and the machine. Wiley (1948)"},{"key":"34_CR67","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/BF01445300","volume":"59","author":"E. Zermelo","year":"1904","unstructured":"Zermelo, E.: Beweis, da jede Menge wohlgeordnet werden kann. Mathematische Annalen\u00a059, 514\u2013516 (1904)","journal-title":"Mathematische Annalen"},{"key":"34_CR68","unstructured":"Zermelo, E.: Ueber eine Anwendung der Mengenlehre auf die Theorie des Schachspiels. In: Proceedings of the Fifth International Congress of Mathematicians, pp. 501\u2013504. Cambridge University Press (1913)"}],"container-title":["Lecture Notes in Computer Science","Information Theory, Combinatorics, and Search Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36899-8_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:18:06Z","timestamp":1558300686000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36899-8_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642368981","9783642368998"],"references-count":68,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36899-8_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}