{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T12:20:40Z","timestamp":1755692440603},"reference-count":6,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1993,9,1]],"date-time":"1993-09-01T00:00:00Z","timestamp":746841600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1993,9]]},"DOI":"10.1016\/0020-0190(93)90034-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"209-214","source":"Crossref","is-referenced-by-count":5,"title":["A faster alternative to SSS* with extension to variable memory"],"prefix":"10.1016","volume":"47","author":[{"given":"Subir","family":"Bhattacharya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A","family":"Bagchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90034-7_BIB1","article-title":"AI search techniques for game trees: Making effective use of available memory and processors","author":"Bhattacharya","year":"1990"},{"key":"10.1016\/0020-0190(93)90034-7_BIB2","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"},{"key":"10.1016\/0020-0190(93)90034-7_BIB3","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","article-title":"Low overhead alternatives to SSS*","volume":"31","author":"Marsland","year":"1987","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0190(93)90034-7_BIB4","author":"Pearl","year":"1984"},{"key":"10.1016\/0020-0190(93)90034-7_BIB5","first-page":"297","article-title":"Fast recursive formulations for best-first search that allow controlled use of memory","author":"Sen","year":"1989","journal-title":"Proc. IJCAI-89"},{"key":"10.1016\/0020-0190(93)90034-7_BIB6","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"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019093900347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:27:56Z","timestamp":1555144076000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019093900347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,9]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1993,9]]}},"alternative-id":["0020019093900347"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90034-7","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,9]]}}}