{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T16:34:02Z","timestamp":1740155642013,"version":"3.37.3"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput. Intell. AI Games"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/tciaig.2015.2508966","type":"journal-article","created":{"date-parts":[[2015,12,17]],"date-time":"2015-12-17T19:41:21Z","timestamp":1450381281000},"page":"109-122","source":"Crossref","is-referenced-by-count":1,"title":["Product Propagation: A Backup Rule Better Than Minimaxing?"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1133-0529","authenticated-orcid":false,"given":"Hermann","family":"Kaindl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Horacek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Scheucher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.08.002"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321444"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8788-6_13"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF00977966"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(83)80011-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01414444"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2009.5346327"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/34.106996"},{"key":"ref18","first-page":"507","article-title":"On optimal game tree propagation for imperfect players","author":"baum","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273602"},{"journal-title":"Heuristics Intelligent Search Strategies for Computer Problem Solving","year":"1984","author":"pearl","key":"ref4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(95)00096-8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87608-3_19"},{"key":"ref6","first-page":"102","article-title":"Pathology on game trees: A summary of results","author":"nau","year":"0","journal-title":"Proc Nat Conf Artif Intell"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(83)90004-8"},{"key":"ref8","first-page":"840","article-title":"Improving local decisions in adversarial search","author":"wilson","year":"0","journal-title":"Proc ECAI’12"},{"key":"ref7","first-page":"103","article-title":"An analysis of minimax","author":"beal","year":"1980","journal-title":"Advances in Computer Chess"},{"key":"ref2","first-page":"760","article-title":"Searching to variable depth in computer chess","author":"kaindl","year":"0","journal-title":"Proc 1983 Int Joint Conf Artificial Intell"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(97)00073-8"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1144079"},{"key":"ref20","first-page":"100","article-title":"Developments on product propagation","author":"saffidine","year":"2013","journal-title":"Proc of CGO 2013"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2100396"},{"key":"ref21","first-page":"61","article-title":"PDS-PN: A new proof-number search algorithm–application to lines of action","author":"winands","year":"2003","journal-title":"CGDC 2002 Proceedings"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(90)90069-C"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633630"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"ref25","first-page":"286","article-title":"Digital computers applied to games","author":"turing","year":"1953","journal-title":"Faster Than Thought"}],"container-title":["IEEE Transactions on Computational Intelligence and AI in Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4804728\/7948819\/07358032.pdf?arnumber=7358032","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T02:35:10Z","timestamp":1633919710000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7358032\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":27,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2015.2508966","relation":{},"ISSN":["1943-068X","1943-0698"],"issn-type":[{"type":"print","value":"1943-068X"},{"type":"electronic","value":"1943-0698"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}