{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:15:47Z","timestamp":1767705347429},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4549,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1016\/s0304-3975(00)00081-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:41:58Z","timestamp":1027608118000},"page":"177-196","source":"Crossref","is-referenced-by-count":17,"title":["Multi-cut \u03b1\u03b2-pruning in game-tree search"],"prefix":"10.1016","volume":"252","author":[{"given":"Yngvi","family":"Bj\u00f6rnsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tony A.","family":"Marsland","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00081-5_BIB1","series-title":"A statistical study of selective min\u2013max search in computer chess, Ph.D. Thesis","author":"Anantharaman","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(00)00081-5_BIB2","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(90)90073-9","article-title":"Singular extensions, Adding selectivity to brute-force searching","volume":"43","author":"Anantharaman","year":"1990","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0304-3975(00)00081-5_BIB3","series-title":"Experiments with the Null Move","first-page":"65","author":"Beal","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(00)00081-5_BIB4","first-page":"14","article-title":"Are there practical alternatives to alpha\u2013beta?","volume":"21","author":"Junghanns","year":"1998","journal-title":"ICCA J."},{"issue":"4","key":"10.1016\/S0304-3975(00)00081-5_BIB5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha\u2013beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial intelligence"},{"key":"10.1016\/S0304-3975(00)00081-5_BIB6","unstructured":"T.A. Marsland. Relative efficiency of alpha\u2013beta implementations, Proc. of the Internat. Joint Conf. on Artificial Intelligence (IJCAI-83), Karlsruhe, Germany, August 1983, pp. 763\u2013766"},{"key":"10.1016\/S0304-3975(00)00081-5_BIB7","first-page":"317","article-title":"Single-agent and Game-tree search","volume":"vol. 27","author":"Marsland","year":"1993"},{"issue":"4","key":"10.1016\/S0304-3975(00)00081-5_BIB8","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1109\/TPAMI.1985.4767683","article-title":"Parallel game-tree search","volume":"7","author":"Marsland","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Mach. Intelligence PAMI-"},{"key":"10.1016\/S0304-3975(00)00081-5_BIB9","unstructured":"D.A. McAllester, D. Yuret, Alpha\u2013beta-conspiracy search, 1993, URL: http:\/\/www.research.att.com\/\u223cdmac\/abc.ps."},{"key":"10.1016\/S0304-3975(00)00081-5_BIB10","unstructured":"D.S. Nau, Pathology on game trees, A summary of results, Proc. ACM National Conf. on Artificial Intelligence, 1980, pp. 102\u2013104."},{"issue":"4","key":"10.1016\/S0304-3975(00)00081-5_BIB11","first-page":"4","article-title":"An improvement to the Scout tree search algorithm","volume":"6","author":"Reinefeld","year":"1983","journal-title":"ICCA J."},{"key":"10.1016\/S0304-3975(00)00081-5_BIB12","unstructured":"F. Reinfeld, 1001 Brilliant Ways to Checkmate, Sterling Publishing Co., New York, NJ., Reprinted by Melvin Powers Wilshire Book Company, 1955."},{"issue":"1","key":"10.1016\/S0304-3975(00)00081-5_BIB13","doi-asserted-by":"crossref","first-page":"1203","DOI":"10.1109\/34.42858","article-title":"The history heuristic and alpha\u2013beta search enhancements in practice","volume":"11","author":"Schaeffer","year":"1989","journal-title":"IEEE Trans. Pattern Anal. Mach. Intelligence"},{"key":"10.1016\/S0304-3975(00)00081-5_BIB14","doi-asserted-by":"crossref","unstructured":"D.J. Slate, L.R. Atkin, Chess Skill in Man and Machine, ch. 4, CHESS 4.5 \u2013 Northwestern University Chess Program, Springer, New York, 1977, pp. 82\u2013118.","DOI":"10.1007\/978-3-662-06239-5_4"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000815?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500000815?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T02:54:31Z","timestamp":1556420071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500000815"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["S0304397500000815"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00081-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}