{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:22:18Z","timestamp":1725488538403},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_39","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"466-478","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Controlled Conspiracy-2 Search"],"prefix":"10.1007","author":[{"given":"Ulf","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"key":"39_CR1","first-page":"255","volume":"87","author":"A. Bruin de","year":"1999","unstructured":"A. de Bruin A. Plaat, J. Schaeffer and W. Pijls. A minimax Algorithm better than SSS*. Artificial Intelligence, 87:255\u2013293, 1999.","journal-title":"Artificial Intelligence"},{"issue":"2","key":"39_CR2","first-page":"47","volume":"14","author":"T.S. Anantharaman","year":"1991","unstructured":"T.S. Anantharaman. Extension heuristics. ICCA Journal, 14(2):47\u201363, 1991.","journal-title":"ICCA Journal"},{"key":"39_CR3","unstructured":"D.F. Beal. Experiments with the null move. Advances in Computer Chess 5 (ed. Beal, D.F.), pages 65\u201379, 1989."},{"issue":"2","key":"39_CR4","first-page":"24","volume":"11","author":"H. Bednorz","year":"1994","unstructured":"H. Bednorz and F. T\u00f6nissen. Der neue Bednorz-T\u00f6nissen-Test. Computer Schach und Spiele, 11(2):24\u201327, 1994.","journal-title":"Computer Schach und Spiele"},{"issue":"1","key":"39_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0004-3702(79)90003-1","volume":"12","author":"H. Berliner","year":"1979","unstructured":"H. Berliner. The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence, 12(1):23\u201340, 1979.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"39_CR6","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":"39_CR7","unstructured":"R. Feldmann. Fail high reductions. Advances in Computer Chess 8 (ed. J. van den Herik), 1996."},{"issue":"4","key":"39_CR8","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":"39_CR9","unstructured":"U. Lorenz. Controlled conspiracy-2 search. Technical report, University of Paderborn, available via \n                  http:\/\/www.upb.de\/cs\/agmonien\/PERSONAL\/FLULO\/publications.html\n                  \n                , 1999."},{"key":"39_CR10","unstructured":"U. Lorenz and B. Monien. The secret of selective game tree search, when using random-error evaluations. Technical report, University of Paderborn, available via \n                  http:\/\/www.upb.de\/cs\/ag-monien\/PERSONAL\/FLULO\/publications.html\n                  \n                , 1998."},{"issue":"3","key":"39_CR11","first-page":"135","volume":"18","author":"U. Lorenz","year":"1995","unstructured":"U. Lorenz, V. Rottmann, R. Feldmann, and P. Mysliwietz. Controlled conspiracy number search. ICCA Journal, 18(3):135\u2013147, 1995.","journal-title":"ICCA Journal"},{"issue":"1","key":"39_CR12","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","volume":"31","author":"T.A. Marsland","year":"1987","unstructured":"T.A. Marsland, A. Reinefeld, and J. Schaeffer. Low overhead alternatives to SSS*. Artificial Intelligence, 31(1):185\u2013199, 1987.","journal-title":"Artificial Intelligence"},{"issue":"1","key":"39_CR13","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":"39_CR14","unstructured":"A.J. Palay. Searching with Probabilities. 1985."},{"key":"39_CR15","volume-title":"Heuristics \u2014 Intelligent Search Strategies for Computer Problem Solving","author":"J. Pearl","year":"1984","unstructured":"J. Pearl. Heuristics \u2014 Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Publishing Co., Reading, MA, 1984."},{"issue":"1","key":"39_CR16","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0004-3702(87)90004-X","volume":"34","author":"R.L. Rivest","year":"1987","unstructured":"R.L. Rivest. Game tree searching by min\/max approximation. Artificial Intelligence, 34(1):77\u201396, 1987.","journal-title":"Artificial Intelligence"},{"issue":"3","key":"39_CR17","first-page":"16","volume":"6","author":"J. Schaeffer","year":"1983","unstructured":"J. Schaeffer. The history heuristic. ICCA Journal, 6(3):16\u201319, 1983.","journal-title":"ICCA Journal"},{"issue":"1","key":"39_CR18","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":"39_CR19","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","volume":"12","author":"G.C. Stockman","year":"1979","unstructured":"G.C. Stockman. A minimax algorithm better than alpha-beta? Artificial Intelligence, 12(2):179\u2013196, 1979.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T11:39:56Z","timestamp":1578483596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_39"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_39","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}