{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T06:38:52Z","timestamp":1649054332586},"reference-count":8,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1994,12,1]],"date-time":"1994-12-01T00:00:00Z","timestamp":786240000000},"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":[[1994,12]]},"DOI":"10.1016\/0020-0190(94)00166-9","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:37:30Z","timestamp":1027640250000},"page":"295-301","source":"Crossref","is-referenced-by-count":0,"title":["A general framework for minimax search in game trees"],"prefix":"10.1016","volume":"52","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(94)00166-9_BIB1","first-page":"163","article-title":"Making best use of available memory when searching game trees","author":"Bhattacharya","year":"1986","journal-title":"Proc. AAAI-86"},{"key":"10.1016\/0020-0190(94)00166-9_BIB2","article-title":"Unified recursive schemes for search in game trees","author":"Bhattacharya","year":"1990"},{"key":"10.1016\/0020-0190(94)00166-9_BIB3","first-page":"211","article-title":"QuickGame: A compromise between pure depth-first and pure best-first game tree search strategies","author":"Bhattacharya","year":"1992","journal-title":"Proc. IEEE Internat. Workshop on Automated Reasoning"},{"key":"10.1016\/0020-0190(94)00166-9_BIB4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(93)90034-7","article-title":"A faster alternative to SSS* with extension to variable memory","volume":"47","author":"Bhattacharya","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(94)00166-9_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(86)90092-5","article-title":"Generalization of Alpha-Beta and SSS* search procedures","volume":"29","author":"Ibaraki","year":"1986","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0020-0190(94)00166-9_BIB6","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(94)00166-9_BIB7","author":"Pearl","year":"1984"},{"key":"10.1016\/0020-0190(94)00166-9_BIB8","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","article-title":"A minimax algorithm better than alphabeta?","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:0020019094001669?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019094001669?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:52:49Z","timestamp":1555131169000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019094001669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0020019094001669"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00166-9","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}