{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:31:23Z","timestamp":1773930683396,"version":"3.50.1"},"reference-count":16,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,2,1]],"date-time":"1987-02-01T00:00:00Z","timestamp":539136000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1987,2]]},"DOI":"10.1016\/0004-3702(87)90019-1","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T08:02:52Z","timestamp":1047628972000},"page":"185-199","source":"Crossref","is-referenced-by-count":27,"title":["Low overhead alternatives to SSS\u2217"],"prefix":"10.1016","volume":"31","author":[{"given":"T.A.","family":"Marsland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Reinefeld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Schaeffer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0004-3702(87)90019-1_BIB1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm better than alpha-beta?","volume":"12","author":"Stockman","year":"1979","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/0004-3702(87)90019-1_BIB2","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0004-3702(80)90037-5","article-title":"Asymptotic properties of minimax trees and game-seraching procedures","volume":"14","author":"Pearl","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(87)90019-1_BIB3","author":"Fishburn","year":"1984"},{"issue":"4","key":"10.1016\/0004-3702(87)90019-1_BIB4","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/356893.356895","article-title":"Parallel search of strongly ordered game trees","volume":"14","author":"Marsland","year":"1982","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0004-3702(87)90019-1_BIB5","series-title":"Proceedings IJCAI-83","first-page":"763","article-title":"Relative efficiency of alpha-beta implementations","author":"Marsland","year":"1983"},{"issue":"4","key":"10.1016\/0004-3702(87)90019-1_BIB6","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(83)90001-2","article-title":"A comparison of minimax tree search algorithms","volume":"20","author":"Campbell","year":"1983","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/0004-3702(87)90019-1_BIB7","first-page":"4","article-title":"An improvement of the Scout tree search algorithm","volume":"6","author":"Reinefeld","year":"1983","journal-title":"ICCA J."},{"issue":"3","key":"10.1016\/0004-3702(87)90019-1_BIB8","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TSMC.1985.6313374","article-title":"An empirical comparison of pruning strategies in game trees","volume":"15","author":"Musczycka","year":"1985","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/0004-3702(87)90019-1_BIB9","series-title":"Proceedings IJCAI-85","first-page":"1040","article-title":"Information acquisition in minimal window search","author":"Reinefeld","year":"1985"},{"key":"10.1016\/0004-3702(87)90019-1_BIB10","article-title":"The design and analysis of algorithms for asynchronous multiprocessors","author":"Baudet","year":"1978"},{"key":"10.1016\/0004-3702(87)90019-1_BIB11","doi-asserted-by":"crossref","DOI":"10.3233\/ICG-1986-9309","article-title":"Experiments in search and knowledge","author":"Schaeffer","year":"1986"},{"key":"10.1016\/0004-3702(87)90019-1_BIB12","article-title":"Is best first search best?","author":"Reinefeld","year":"1985"},{"issue":"6","key":"10.1016\/0004-3702(87)90019-1_BIB13","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1109\/TPAMI.1984.4767600","article-title":"Parallel branch-and-bound formulations for AND\/OR tree search","volume":"6","author":"Kumar","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0004-3702(87)90019-1_BIB14","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/321510.321511","article-title":"Experiments with some programs that search game trees","volume":"2","author":"Slagle","year":"1969","journal-title":"J. ACM"},{"issue":"1, 2","key":"10.1016\/0004-3702(87)90019-1_BIB15","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/S0004-3702(83)80010-1","article-title":"A minimax algorithm better than alpha-beta? Yes and no","volume":"21","author":"Roizen","year":"1983","journal-title":"Artificial Intelligence"},{"issue":"4","key":"10.1016\/0004-3702(87)90019-1_BIB16","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","article-title":"An analysis of alpha-beta pruning","volume":"6","author":"Knuth","year":"1975","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370287900191?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370287900191?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T19:56:28Z","timestamp":1553630188000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370287900191"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,2]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,2]]}},"alternative-id":["0004370287900191"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(87)90019-1","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1987,2]]}}}