{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T21:29:04Z","timestamp":1672349344588},"reference-count":20,"publisher":"Elsevier BV","issue":"2","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":["Artificial Intelligence"],"published-print":{"date-parts":[[1994,12]]},"DOI":"10.1016\/0004-3702(94)90049-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"397-408","source":"Crossref","is-referenced-by-count":4,"title":["Time-efficient state space search"],"prefix":"10.1016","volume":"71","author":[{"given":"Alexander","family":"Reinefeld","sequence":"first","affiliation":[]},{"given":"Peter","family":"Ridinger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)90049-3_BIB1","series-title":"Proceedings AAAI-86","first-page":"163","article-title":"Making best use of available memory when searching game trees","author":"Bhattacharya","year":"1986"},{"key":"10.1016\/0004-3702(94)90049-3_BIB2","series-title":"Working Paper Series WPS-144","article-title":"Unified recursive schemes for search in game trees","author":"Bhattacharya","year":"1990"},{"key":"10.1016\/0004-3702(94)90049-3_BIB3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0020-0190(93)90034-7","article-title":"A faster alternative to SSS\u2217 with extension to variable memory","volume":"47","author":"Bhattacharya","year":"1993","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(94)90049-3_BIB4","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/0004-3702(92)90059-7","article-title":"Iterative broadening","volume":"55","author":"Ginsberg","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90049-3_BIB5","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(86)90092-5","article-title":"Generalization of Alpha-Beta and SSS\u2217 search problems","volume":"29","author":"Ibaraki","year":"1986","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)90049-3_BIB6","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01531075","article-title":"Searching minimax game trees under memory space constraint","volume":"1","author":"Ibaraki","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"issue":"12","key":"10.1016\/0004-3702(94)90049-3_BIB7","doi-asserted-by":"crossref","first-page":"1225","DOI":"10.1109\/34.106996","article-title":"Minimax search algorithms with and without aspiration windows","volume":"13","author":"Kaindl","year":"1991","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"4","key":"10.1016\/0004-3702(94)90049-3_BIB8","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":"Artif. Intell."},{"issue":"6","key":"10.1016\/0004-3702(94)90049-3_BIB9","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(94)90049-3_BIB10","series-title":"Proceedings ACM-IEEE Fall Joint Computer Conference","article-title":"Phased state space search","author":"Marsland","year":"1986"},{"key":"10.1016\/0004-3702(94)90049-3_BIB11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0004-3702(87)90019-1","article-title":"Low overhead alternatives to SSS\u2217","volume":"31","author":"Marsland","year":"1987","journal-title":"Artif. Intell."},{"issue":"3","key":"10.1016\/0004-3702(94)90049-3_BIB12","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":"Muszycka","year":"1985","journal-title":"IEEE Trans. Syst. Man Cybern."},{"key":"10.1016\/0004-3702(94)90049-3_BIB13","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0004-3702(94)90049-3_BIB14","series-title":"Heuristics\u2014Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/0004-3702(94)90049-3_BIB15","series-title":"Algorithms, International Symposium SIGAL '90","article-title":"Another view on the SSS\u2217 algorithm","volume":"450","author":"Pijls","year":"1990"},{"key":"10.1016\/0004-3702(94)90049-3_BIB16","first-page":"18","article-title":"SSS\u2217-like algorithms in constrained memory","author":"Pijls","year":"1993","journal-title":"Int. Comput. Chess Assoc. J."},{"key":"10.1016\/0004-3702(94)90049-3_BIB17","article-title":"Spielbaum-Suchverfahren","volume":"200","author":"Reinefeld","year":"1989"},{"key":"10.1016\/0004-3702(94)90049-3_BIB18","first-page":"237","article-title":"A minimax algorithm faster than Alpha-Beta","volume":"7","author":"Reinefeld","year":"1994"},{"issue":"1\u20132","key":"10.1016\/0004-3702(94)90049-3_BIB19","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":"Artif. Intell."},{"issue":"2","key":"10.1016\/0004-3702(94)90049-3_BIB20","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":"Artif. Intell."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900493?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370294900493?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T00:57:15Z","timestamp":1553648235000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370294900493"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,12]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,12]]}},"alternative-id":["0004370294900493"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)90049-3","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1994,12]]}}}