{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:35:38Z","timestamp":1759332938699},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,9,1]],"date-time":"1980-09-01T00:00:00Z","timestamp":336614400000},"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":[[1980,9]]},"DOI":"10.1016\/0004-3702(80)90037-5","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"113-138","source":"Crossref","is-referenced-by-count":83,"title":["Asymptotic properties of minimax trees and game-searching procedures"],"prefix":"10.1016","volume":"14","author":[{"given":"Judea","family":"Pearl","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(80)90037-5_BIB1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0004-3702(78)80011-3","article-title":"On the branching factor of the alpha-beta Pruning algorithm","volume":"10","author":"Baudet","year":"1978","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(80)90037-5_BIB2","series-title":"An analysis of the alpha-beta Pruning algorithm","author":"Fuller","year":"1973"},{"key":"10.1016\/0004-3702(80)90037-5_BIB3","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\/0004-3702(80)90037-5_BIB4","author":"Nilsson","year":"1971"},{"key":"10.1016\/0004-3702(80)90037-5_BIB5","author":"Slagle","year":"1971"},{"key":"10.1016\/0004-3702(80)90037-5_BIB6","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"},{"key":"10.1016\/0004-3702(80)90037-5_BIB7","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":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370280900375?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370280900375?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:27:17Z","timestamp":1553642837000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370280900375"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,9]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,9]]}},"alternative-id":["0004370280900375"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(80)90037-5","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1980,9]]}}}