{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:11:19Z","timestamp":1767705079392},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230250"},{"type":"electronic","value":"9783540301400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30140-0_66","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T01:31:13Z","timestamp":1284859873000},"page":"749-759","source":"Crossref","is-referenced-by-count":3,"title":["Beyond Optimal Play in Two-Person-Zerosum Games"],"prefix":"10.1007","author":[{"given":"Ulf","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"66_CR1","first-page":"255","volume":"87","author":"A. Bruin de","year":"1999","unstructured":"de Bruin, A., Plaat, A., Schaeffer, J., Pijls, W.: A minimax Algorithm better than SSS*. Artificial Intelligence\u00a087, 255\u2013293 (1999)","journal-title":"Artificial Intelligence"},{"issue":"3","key":"66_CR2","first-page":"55","volume":"11","author":"I. Alth\u00f6fer","year":"1988","unstructured":"Alth\u00f6fer, I.: Root evaluation errors: How they arise and propagate. ICCA Journal\u00a011(3), 55\u201363 (1988)","journal-title":"ICCA Journal"},{"key":"66_CR3","first-page":"265","volume-title":"Advances in Computer Chess 5","author":"I. Alth\u00f6fer","year":"1990","unstructured":"Alth\u00f6fer, I.: Generalized minmax algorithms are no better error correctors than minmax itself. In: Beal, D.F. (ed.) Advances in Computer Chess 5, pp. 265\u2013282. North-Holland, Amsterdam (1990)"},{"issue":"2","key":"66_CR4","first-page":"47","volume":"14","author":"T.S. Anantharaman","year":"1991","unstructured":"Anantharaman, T.S.: Extension heuristics. ICCA Journal\u00a014(2), 47\u201363 (1991)","journal-title":"ICCA Journal"},{"key":"66_CR5","unstructured":"Doerr, B., Lorenz, U.: Error propagation in game trees. In: submitted to CG (2004)"},{"issue":"3","key":"66_CR6","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"Donninger, C.: Null move and deep search. ICCA Journal\u00a016(3), 137\u2013143 (1993)","journal-title":"ICCA Journal"},{"issue":"1","key":"66_CR7","first-page":"3","volume":"16","author":"P.J. Jansen","year":"1993","unstructured":"Jansen, P.J.: Kqkr: Speculativ thwarting a human opponent. ICCA Journal\u00a016(1), 3\u201317 (1993)","journal-title":"ICCA Journal"},{"key":"66_CR8","unstructured":"Kaindl, H., Scheucher, A.: The reason for the benefits of minmax search. In: Proc. of the 11 th IJCAI, Detroit, MI, pp. 322\u2013327 (1989)"},{"issue":"4","key":"66_CR9","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence\u00a06(4), 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"66_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/3-540-46541-3_39","volume-title":"STACS 2000","author":"U. Lorenz","year":"2000","unstructured":"Lorenz, U.: Controlled Conspiracy-2 Search. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 466\u2013478. Springer, Heidelberg (2000)"},{"key":"66_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-45841-7_16","volume-title":"STACS 2002","author":"U. Lorenz","year":"2002","unstructured":"Lorenz, U., Monien, B.: The secret of selective game tree search, when using random-error evaluations. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 203\u2013214. Springer, Heidelberg (2002)"},{"issue":"1","key":"66_CR12","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D.A. McAllester","year":"1988","unstructured":"McAllester, D.A.: Conspiracy Numbers for Min-Max searching. Artificial Intelligence\u00a035(1), 287\u2013310 (1988)","journal-title":"Artificial Intelligence"},{"key":"66_CR13","volume-title":"Heuristics \u2013 Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"Pearl, J.: Heuristics \u2013 Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading (1984)"},{"key":"66_CR14","first-page":"338","volume-title":"Proceedings of the National Conference on Artificial Intelligence","author":"A.L. Reibman","year":"1983","unstructured":"Reibman, A.L., Ballard, B.W.: Non-Minimax Search Strategies for Use Against Fallible Opponents. In: Proceedings of the National Conference on Artificial Intelligence, pp. 338\u2013342. AAAI, Menlo Park (1983)"},{"key":"66_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74413-6","volume-title":"Spielbaum - Suchverfahren","author":"A. Reinefeld","year":"1989","unstructured":"Reinefeld, A.: Spielbaum - Suchverfahren. Springer, Heidelberg (1989)"},{"issue":"1","key":"66_CR16","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0004-3702(90)90071-7","volume":"43","author":"J. Schaeffer","year":"1990","unstructured":"Schaeffer, J.: Conspiracy numbers. Artificial Intelligence\u00a043(1), 67\u201384 (1990)","journal-title":"Artificial Intelligence"},{"key":"66_CR17","unstructured":"Schr\u00fcfer, G.: Minimax-Suchen Kosten, Qualit\u00e4t und Algorithmen. Doctoral-Thesis, University of Braunschweig, Germany (1988)"},{"key":"66_CR18","first-page":"256","volume":"41","author":"C.E. Shannon","year":"1950","unstructured":"Shannon, C.E.: Programming a computer for playing chess. Philosophical Magazine\u00a041, 256\u2013275 (1950)","journal-title":"Philosophical Magazine"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30140-0_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:52:15Z","timestamp":1620013935000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30140-0_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230250","9783540301400"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30140-0_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}