{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:04:23Z","timestamp":1725483863381},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657668"},{"type":"electronic","value":"9783540489573"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48957-6_2","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T14:16:09Z","timestamp":1178374569000},"page":"15-24","source":"Crossref","is-referenced-by-count":5,"title":["Multi-cut Pruning in Alpha-Beta Search"],"prefix":"10.1007","author":[{"given":"Yngvi","family":"Bj\u00f6rnsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony","family":"Marsland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,3,12]]},"reference":[{"key":"2_CR1","series-title":"PhD thesis","volume-title":"A Statistical Study of Selective Min-Max Search in Computer Chess","author":"T. Anantharaman","year":"1990","unstructured":"T. Anantharaman. A Statistical Study of Selective Min-Max Search in Computer Chess. PhD thesis, Carnegie-Mellon University, Pittsburgh, PA, May 1990."},{"issue":"1","key":"2_CR2","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(90)90073-9","volume":"43","author":"T. Anantharaman","year":"1990","unstructured":"T. Anantharaman, M. S. Campbell, and F. Hsu. Singular extensions: Adding selectivity to brute-force searching. Artificial Intelligence, 43(1):99\u2013109, 1990.","journal-title":"Artificial Intelligence"},{"issue":"4","key":"2_CR3","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":"2_CR4","unstructured":"T. A. Marsland. Single-Agent and Game-Tree Search. In A. Kent and J. G. Williams, editors, Encyclopedia of Computer Science and Technology, volume 27, pages 317\u2013336, New York, 1993. Marcel Dekker, Inc."},{"key":"2_CR5","unstructured":"D. A. McAllester and D. Yuret. Alpha-beta-conspiracy search, 1993. URL: \n                    http:\/\/www.research.att.com\/~dmac\/abc.ps\n                    \n                  ."},{"key":"2_CR6","unstructured":"D. S. Nau. Pathology on game trees: A summary of results. In Proceedings of the ACM National Conference on Artificial Intelligence, pages 102\u2013104, 1980."},{"issue":"4","key":"2_CR7","first-page":"4","volume":"6","author":"A. Reinefeld","year":"1983","unstructured":"A. Reinefeld. An improvement to the Scout tree search algorithm. ICCA Journal, 6(4):4\u201314, 1983.","journal-title":"ICCA Journal"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"1203","DOI":"10.1109\/34.42858","volume":"11","author":"J. Schaeffer","year":"1989","unstructured":"J. Schaeffer. The history heuristic and alpha-beta search enhancements in practice. IEEE Transactions on Pattern Analysis and Machine Intelligence, 11(1):1203\u20131212, 1989.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48957-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:32:03Z","timestamp":1550327523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48957-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657668","9783540489573"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-48957-6_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}