{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:21:52Z","timestamp":1725456112682},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354010027X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0022526","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T00:49:12Z","timestamp":1132706952000},"page":"474-487","source":"Crossref","is-referenced-by-count":1,"title":["Asymptotic complexity of game-searching procedures"],"prefix":"10.1007","author":[{"given":"Judea","family":"Pearl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"35_CR1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D. E. Knuth","year":"1975","unstructured":"Knuth, D. E., and Moore, R. N. An analysis of alpha-beta pruning. Artificial Intelligence 6 (1975), 293\u2013326.","journal-title":"Artificial Intelligence"},{"key":"35_CR2","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1145\/321510.321511","volume":"2","author":"J. R. Slagle","year":"1969","unstructured":"Slagle, J. R., and Dixon, J. K. Experiments with some programs that search game trees. Journal of the ACM 2 (1969), 189\u2013207.","journal-title":"Journal of the ACM"},{"key":"35_CR3","unstructured":"Fuller, S. H., Gaschnig, J. G., and Gillogly, J. J. An analysis of the alphabeta purning algorithm. Department of Computer Science Report, Carnegie-Mellon University (1973)."},{"key":"35_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0004-3702(78)80011-3","volume":"10","author":"G. M. Baudet","year":"1978","unstructured":"Baudet, G. M. On the branching factor of the alpha-beta pruning algorithm. Artificial Intelligence 10 (1978), 173\u2013199.","journal-title":"Artificial Intelligence"},{"key":"35_CR5","volume-title":"An economical method of updating quantile estimates","author":"J. Pearl","year":"1980","unstructured":"Pearl, J. An economical method of updating quantile estimates. UCLA-ENG-CSL-8018, University of California, Los Angeles (1980)."},{"key":"35_CR6","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(79)90016-X","volume":"12","author":"G. Stockman","year":"1979","unstructured":"Stockman, G. A minimax algorithm better than alpha-beta? Artificial Intelligence 12 (1979), 179\u2013196.","journal-title":"Artificial Intelligence"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Pearl, J. Asymptotic properties of minimax trees and game-searching procedures. UCLA-ENG-CSL-7981, University of Los Angeles (1980). To appear in Artificial Intelligence.","DOI":"10.1016\/0004-3702(80)90037-5"},{"key":"35_CR8","volume-title":"A comparison of the alpha-beta and SCOUT algorithms using the game of Kalah","author":"T. Noe","year":"1980","unstructured":"Noe, T. A comparison of the alpha-beta and SCOUT algorithms using the game of Kalah. UCLA-ENG-CSL-8017, University of California, Los Angeles (1980)."},{"key":"35_CR9","volume-title":"The solution for the branching factor of the alpha-beta pruning algorithm","author":"J. Pearl","year":"1980","unstructured":"Pearl, J. The solution for the branching factor of the alpha-beta pruning algorithm. UCLA-ENG-CSL-8019, University of California, Los Angeles (1980)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1980"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0022526","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T00:21:02Z","timestamp":1586564462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022526"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354010027X"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0022526","relation":{},"subject":[]}}