{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:14:19Z","timestamp":1767705259250},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432838"},{"type":"electronic","value":"9783540458418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45841-7_16","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:11:17Z","timestamp":1186891877000},"page":"203-214","source":"Crossref","is-referenced-by-count":4,"title":["The Secret of Selective Game Tree Search, When Using Random-Error Evaluations"],"prefix":"10.1007","author":[{"given":"U.","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B.","family":"Monien","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"issue":"3","key":"16_CR1","first-page":"55","volume":"11","author":"I. Alth\u00f6fer","year":"1988","unstructured":"I. Alth\u00f6fer. Root evaluation errors: How they arise and propagate. ICCA Journal, 11(3):55\u201363, 1988.","journal-title":"ICCA Journal"},{"issue":"3","key":"16_CR2","first-page":"137","volume":"16","author":"C. Donninger","year":"1993","unstructured":"C. Donninger. Null move and deep search. ICCA Journal, 16(3):137\u2013143, 1993.","journal-title":"ICCA Journal"},{"key":"16_CR3","unstructured":"R. Feldmann. Fail high reductions. Advances in Computer Chess 8 (ed. J. van den Herik), 1996."},{"key":"16_CR4","unstructured":"H. Kaindl and A. Scheucher. The reason for the benefits of minmax search. In Proc. of the 11 th IJCAI, pages 322\u2013327, Detroit, MI, 1989."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"D.E. Knuth and R.W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293\u2013326, 1975.","journal-title":"Artificial Intelligence"},{"key":"16_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1007\/3-540-46541-3_39","volume-title":"Controlled Conspiracy-2 Search","author":"U. Lorenz","year":"2000","unstructured":"U. Lorenz. Controlled Conspiracy-2 Search. Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science (STACS), (H. Reichel, S. Tison eds), Springer LNCS, pages 466\u2013478, 2000."},{"issue":"3","key":"16_CR7","first-page":"188","volume":"23","author":"U. Lorenz","year":"2000","unstructured":"U. Lorenz. P. ConNers wins the 10th Grandmaster Tournament in Lippstadt. ICCA Journal, 23(3):188\u2013192, 2000.","journal-title":"ICCA Journal"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"U. Lorenz. Parallel controlled conspiracy number search. Proceedings of the 13th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), ACM Press, pages 320\u2013321, 2001.","DOI":"10.1145\/378580.378737"},{"issue":"1","key":"16_CR9","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0004-3702(88)90019-7","volume":"35","author":"D.A. McAllester","year":"1988","unstructured":"D.A. McAllester. Conspiracy Numbers for Min-Max searching. Artificial Intelligence, 35(1):287\u2013310, 1988.","journal-title":"Artificial Intelligence"},{"key":"16_CR10","unstructured":"D.S. Nau. Quality of Decision versus depth of search on game trees. PhD thesis, Duke University, Durham, NC, 1979."},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/0004-3702(83)90004-8","volume":"20","author":"J. Pearl","year":"1983","unstructured":"J. Pearl. On the nature of pathology in game searching. Artificial Intelligence, 20(4):427\u2013453, 1983.","journal-title":"Artificial Intelligence"},{"key":"16_CR12","unstructured":"J. Pearl. Heuristics \u2014 Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading, MA, 1984."},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0004-3702(90)90071-7","volume":"43","author":"J. Schaeffer","year":"1990","unstructured":"J. Schaeffer. Conspiracy numbers. Artificial Intelligence, 43(1):67\u201384, 1990.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"16_CR14","first-page":"95","volume":"20","author":"J. Schaeffer","year":"1997","unstructured":"J. Schaeffer and A. Plaat. Kasparov versus Deep Blue: The Rematch. ICCA Journal, 20(2):95\u2013125, 1997.","journal-title":"ICCA Journal"}],"container-title":["Lecture Notes in Computer Science","STACS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45841-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T15:19:29Z","timestamp":1550762369000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45841-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432838","9783540458418"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45841-7_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}