{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:37:48Z","timestamp":1725493068529},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540440499"},{"type":"electronic","value":"9783540457060"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002]]},"DOI":"10.1007\/3-540-45706-2_57","type":"book-chapter","created":{"date-parts":[[2007,10,7]],"date-time":"2007-10-07T05:37:18Z","timestamp":1191735438000},"page":"420-430","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Parallel Controlled Conspiracy Number Search"],"prefix":"10.1007","author":[{"given":"U.","family":"Lorenz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,20]]},"reference":[{"issue":"2","key":"57_CR1","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"},{"issue":"3","key":"57_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":"57_CR3","unstructured":"R. Feldmann. Fail high reductions. Advances in Computer Chess 8 (ed. J. van den Herik), 1996."},{"key":"57_CR4","doi-asserted-by":"crossref","unstructured":"R. Feldmann, M. Mysliwietz, and B. Monien. Studying overheads in massively parallel min\/max-tree evaluation. In 6th ACM Annual symposium on parallel algorithms and archi-tectures (SPAA\u201994), pages 94\u2013104, New York, NY, 1994. ACM.","DOI":"10.1145\/181014.192325"},{"key":"57_CR5","doi-asserted-by":"crossref","unstructured":"R.M. Karp and Y Zhang. On parallel evaluation of game trees. In First ACM Annual symposium on parallel algorithms and architectures (SPAA\u201989), pages 409\u2013420, New York, NY, 1989. ACM.","DOI":"10.1145\/72935.72979"},{"issue":"4","key":"57_CR6","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":"57_CR7","doi-asserted-by":"crossref","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.","DOI":"10.1007\/3-540-46541-3_39"},{"key":"57_CR8","doi-asserted-by":"crossref","unstructured":"U. Lorenz. P.ConNers wins the 10th Grandmaster Tournament in Lippstadt. ICGA Journal, 23(3), 2000.","DOI":"10.3233\/ICG-2000-23315"},{"key":"57_CR9","doi-asserted-by":"crossref","unstructured":"U. Lorenz. Parallel controlled conspiracy number search. In 13th ACM Annual symposium on parallel algorithms and architectures (SPAA\u201901), pages 320\u2013321, NY, 2001. ACM.","DOI":"10.1145\/378580.378737"},{"key":"57_CR10","doi-asserted-by":"crossref","unstructured":"U. Lorenz and B. Monien. The secret of selective game tree search, when using random-error evaluations. Accepted for the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS) 2002, to appear.","DOI":"10.1007\/3-540-45841-7_16"},{"issue":"1","key":"57_CR11","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"},{"issue":"1","key":"57_CR12","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"},{"key":"57_CR13","unstructured":"J.W. Romein, A. Plaat, H.E. Bal, and J. Schaeffer. Transposition Table Driven Work Scheduling in Distributed Search. In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), pages 725\u2013731, 1999."},{"issue":"1","key":"57_CR14","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"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2002 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45706-2_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:21:48Z","timestamp":1587342108000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45706-2_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540440499","9783540457060"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-45706-2_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"20 August 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}