{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:27:13Z","timestamp":1758274033537},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,6,9]],"date-time":"2006-06-09T00:00:00Z","timestamp":1149811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1007\/s00186-006-0064-6","type":"journal-article","created":{"date-parts":[[2006,6,8]],"date-time":"2006-06-08T09:56:17Z","timestamp":1149760577000},"page":"79-93","source":"Crossref","is-referenced-by-count":2,"title":["Error Propagation in Game Trees"],"prefix":"10.1007","volume":"64","author":[{"given":"Benjamin","family":"Doerr","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,9]]},"reference":[{"issue":"3","key":"64_CR1","first-page":"55","volume":"11","author":"I Alth\u00f6fer","year":"1988","unstructured":"Alth\u00f6fer I (1988) Root evaluation errors: how they arise and propagate. ICCA J 11(3):55\u201363","journal-title":"ICCA J"},{"issue":"2","key":"64_CR2","first-page":"47","volume":"14","author":"TS Anantharaman","year":"1991","unstructured":"Anantharaman TS (1991) Extension heuristics. ICCA J 14(2):47\u201363","journal-title":"ICCA J"},{"key":"64_CR3","unstructured":"Ballard BW (1982) A search procedure for perfect information games of chance.In: proceedings of AAAI, pp 111\u2013114"},{"key":"64_CR4","first-page":"255","volume":"87","author":"A Bruin de","year":"1999","unstructured":"de Bruin A, Plaat A, Schaeffer J, Pijls W (1999) A minimax algorithm better than SSS*. Artif Intell 87:255\u2013293","journal-title":"Artif Intell"},{"issue":"3","key":"64_CR5","first-page":"137","volume":"16","author":"C Donninger","year":"1993","unstructured":"Donninger C (1993) Null move and deep search. ICCA J 16(3):137\u2013143","journal-title":"ICCA J"},{"key":"64_CR6","unstructured":"Ehrhoff J, Grothklags S, Halbsgut J, Lorenz U, Sauerwald T (2003) The repair game: robust plans and disturbation management in aircraft scheduling by the help of game tree search. In: Proceedings of 43rd Annual symposium of the airline Group of the International Federation of Operational Research Societies (AGIFORS), Paris, France"},{"key":"64_CR7","unstructured":"Kaindl H, Scheucher A (1989) The reason for the benefits of minmax search. In: Proceedings of the 11th IJCAI, pp 322\u2013327, Detroit"},{"issue":"4","key":"64_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1975","unstructured":"Knuth DE, Moore RW (1975) An analysis of alpha-beta pruning. Artif Intell 6(4):293\u2013326","journal-title":"Artif Intell"},{"key":"64_CR9","first-page":"466","volume-title":"Proceedings of the 17th STACS, LNCS","author":"U Lorenz","year":"2000","unstructured":"Lorenz U (2000). Controlled conspiracy-2 search. In: Reichel H, Tison S (eds). Proceedings of the 17th STACS, LNCS. Springer, Berlin Heidelberg New York, pp. 466\u2013478"},{"key":"64_CR10","first-page":"749","volume-title":"Proceedings of the 12th Annual European symposium on algorithms (ESA). LNCS 3221","author":"U Lorenz","year":"2004","unstructured":"Lorenz U (2004). Beyond optimal play in two-person-zerosum games. In: Albers S., Radzik T. (eds), Proceedings of the 12th Annual European symposium on algorithms (ESA) LNCS 3221. Springer, Berlin Heidelberg New York, pp. 749\u2013759"},{"key":"64_CR11","first-page":"203","volume-title":"Proceedings of the 19th STACS LNCS","author":"U Lorenz","year":"2002","unstructured":"Lorenz U, Monien B (2002). The secret of selective game tree search, when using random-error evaluations. In: Alt H., Ferreira A. (eds). Proceedings of the 19th STACS LNCS. Springer, Berlin Heidelberg New York, pp. 203\u2013214"},{"issue":"1","key":"64_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"DA McAllester","year":"1988","unstructured":"McAllester DA (1988) Conspiracy numbers for min-max searching. Artif Intell 35(1):287\u2013310","journal-title":"Artif Intell"},{"key":"64_CR13","volume-title":"Heuristics \u2013 intelligent search strategies for computer problem solving","author":"J Pearl","year":"1984","unstructured":"Pearl J (1984) Heuristics \u2013 intelligent search strategies for computer problem solving. Addison-Wesley Publishing Co., Reading"},{"key":"64_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74413-6","volume-title":"Spielbaum - Suchverfahren","author":"A Reinefeld","year":"1989","unstructured":"Reinefeld A (1989) Spielbaum - Suchverfahren. Springer, Berlin Heidelberg New York"},{"key":"64_CR15","unstructured":"Reibmann AL, Ballard BW (1983) Non-minimax search strategies for use against fallible opponents. AAAI, pp 338\u2013342"},{"issue":"1","key":"64_CR16","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0004-3702(90)90071-7","volume":"43","author":"J Schaeffer","year":"1990","unstructured":"Schaeffer J (1990) Conspiracy numbers. Artif Intell 43(1):67\u201384","journal-title":"Artif Intell"},{"key":"64_CR17","unstructured":"Schr\u00fcfer G (1988) Minimax-Suchen Kosten, Qualit\u00e4t und Algorithmen. PhD Thesis, University of Braunschweig"},{"key":"64_CR18","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1080\/14786445008521796","volume":"41","author":"CE Shannon","year":"1950","unstructured":"Shannon CE (1950) Programming a computer for playing chess. Philos Mag 41:256\u2013275","journal-title":"Philos Mag"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-006-0064-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00186-006-0064-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-006-0064-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:33:24Z","timestamp":1558607604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00186-006-0064-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,9]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["64"],"URL":"https:\/\/doi.org\/10.1007\/s00186-006-0064-6","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"value":"1432-2994","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,9]]}}}