{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T03:34:13Z","timestamp":1763436853009,"version":"3.41.0"},"publisher-location":"New York, NY, USA","edition-number":"1","reference-count":10,"publisher":"ACM","isbn-type":[{"type":"print","value":"9781450395861"}],"license":[{"start":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T00:00:00Z","timestamp":1646006400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,2,28]]},"DOI":"10.1145\/3501714.3501724","type":"book-chapter","created":{"date-parts":[[2022,3,4]],"date-time":"2022-03-04T20:58:40Z","timestamp":1646427520000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["The Solution for the Branching Factor of the Alpha-Beta Pruning Algorithm and its Optimality"],"prefix":"10.1145","author":[{"given":"Judea","family":"Pearl","sequence":"first","affiliation":[]}],"member":"320","published-online":{"date-parts":[[2022,3,4]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_2","DOI":"10.1016\/S0004-3702(78)80011-3"},{"key":"e_1_3_2_1_3_2","volume-title":"An analysis of the alpha\u2013beta pruning algorithm. Department of Computer Science Report","author":"Fuller S.H.","year":"1973","unstructured":"Fuller , S.H. , Gaschnig , J.G. , and Gillogly , J.J . An analysis of the alpha\u2013beta pruning algorithm. Department of Computer Science Report , Carnegie-Mellon University , ( 1973 ). Fuller, S.H., Gaschnig, J.G., and Gillogly, J.J. An analysis of the alpha\u2013beta pruning algorithm. Department of Computer Science Report, Carnegie-Mellon University, (1973)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_2","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"e_1_3_2_1_5_2","volume-title":"Functional Equations in a Single Variable","author":"Kuczma M.","year":"1968","unstructured":"Kuczma , M. Functional Equations in a Single Variable . Polish Scientific Publishers , Warszawa , ( 1968 ), p. 141. Kuczma, M. Functional Equations in a Single Variable. Polish Scientific Publishers, Warszawa, (1968), p. 141."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_2","DOI":"10.1016\/0004-3702(80)90037-5"},{"doi-asserted-by":"crossref","unstructured":"Pearl J. A space-efficient on-line method of computing quantile estimates J. of Algorithms 2 2 (June 1981) 24\u201328. Pearl J. A space-efficient on-line method of computing quantile estimates J. of Algorithms 2 2 (June 1981) 24\u201328.","key":"e_1_3_2_1_7_2","DOI":"10.1016\/0196-6774(81)90017-1"},{"key":"e_1_3_2_1_8_2","volume-title":"Cognitive Systems Laboratory","author":"Roizen I.","year":"1981","unstructured":"Roizen , I. On the average number of terminal nodes examined by alpha\u2013beta. UCLA-ENG-CSL-8108 , Cognitive Systems Laboratory , University of California , Los Angeles , ( 1981 ). Roizen, I. On the average number of terminal nodes examined by alpha\u2013beta. UCLA-ENG-CSL-8108, Cognitive Systems Laboratory, University of California, Los Angeles, (1981)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_2","DOI":"10.1145\/321510.321511"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_2","DOI":"10.1016\/0004-3702(79)90016-X"},{"key":"e_1_3_2_1_11_2","volume-title":"Cognitive Systems Laboratory","author":"Tarsi M.","year":"1981","unstructured":"Tarsi , M. Optimal searching of some game trees. UCLA-ENG- CSL-8108 , Cognitive Systems Laboratory , University of California , Los Angeles , ( 1981 ). (To appear in JACM.) Tarsi, M. Optimal searching of some game trees. UCLA-ENG- CSL-8108, Cognitive Systems Laboratory, University of California, Los Angeles, (1981). (To appear in JACM.)"}],"container-title":["Probabilistic and Causal Inference"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501714.3501724","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3501714.3501724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:45Z","timestamp":1750191105000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3501714.3501724"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,28]]},"ISBN":["9781450395861"],"references-count":10,"alternative-id":["10.1145\/3501714.3501724","10.1145\/3501714"],"URL":"https:\/\/doi.org\/10.1145\/3501714.3501724","relation":{},"subject":[],"published":{"date-parts":[[2022,2,28]]},"assertion":[{"value":"2022-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-03-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}