{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:24:55Z","timestamp":1775031895277,"version":"3.50.1"},"reference-count":19,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"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. Games"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1109\/tciaig.2017.2717902","type":"journal-article","created":{"date-parts":[[2017,6,21]],"date-time":"2017-06-21T18:40:09Z","timestamp":1498070409000},"page":"69-77","source":"Crossref","is-referenced-by-count":14,"title":["Game Tree Search Based on Nondeterministic Action Scripts in Real-Time Strategy Games"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1914-3840","authenticated-orcid":false,"given":"Nicolas A.","family":"Barriga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marius","family":"Stanescu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Buro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2016.7860439"},{"key":"ref11","article-title":"The combinatorial multi-armed bandit problem and its application to real-time strategy games","author":"onta\u00f1\u00f3n","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"},{"key":"ref12","first-page":"1652","article-title":"Adversarial hierarchical-task network planning for complex real-time games","author":"onta\u00f1\u00f3n","year":"0","journal-title":"Proc 24th Int Conf Artif Intell"},{"key":"ref13","first-page":"1099","article-title":"Introducing hierarchical adversarial search, a scalable search procedure for real-time strategy games","author":"stanescu","year":"0","journal-title":"Proc 21st Conf Artif Intell"},{"key":"ref14","first-page":"66","article-title":"Hierarchical adversarial search applied to real-time strategy games","author":"stanescu","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"},{"key":"ref15","first-page":"73","article-title":"Game-tree search over high-level game states in RTS games","author":"uriarte","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"},{"key":"ref16","first-page":"14","article-title":"High-level representations for game-tree search in RTS games","author":"uriarte","year":"0","journal-title":"Proc AAAI Artif Intell Adversarial Real-Time Games Workshop"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2011.6032018"},{"key":"ref18","first-page":"79","article-title":"A Bayesian model for plan recognition in RTS games applied to StarCraft","author":"synnaeve","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"},{"key":"ref19","first-page":"103","article-title":"A particle model for state estimation in real-time strategy games","author":"weber","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08234-9_18-1"},{"key":"ref3","first-page":"9","article-title":"Puppet Search: Enhancing scripted behaviour by look-ahead search with applications to Real-Time Strategy games","author":"barriga","year":"0","journal-title":"Proc AAAI Conf Artif Intell Interactive Digit Entertain"},{"key":"ref6","first-page":"112","article-title":"Fast heuristic search for RTS game combat scenarios","author":"churchill","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1038\/nature16961"},{"key":"ref8","first-page":"86","article-title":"Using Lanchester attrition laws for combat prediction in StarCraft","author":"stanescu","year":"0","journal-title":"Proc AAAI Conf Artif Intell Interactive Digit Entertain"},{"key":"ref7","first-page":"66","article-title":"Heuristic search applied to abstract combat games","author":"kovarsky","year":"2005","journal-title":"Advances in Artificial Intelligence"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2013.2286295"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.3233\/ICG-2003-26213","article-title":"Arimaa—A new game designed to be difficult for computers","volume":"26","author":"syed","year":"2003","journal-title":"ICGA J"},{"key":"ref9","first-page":"112","article-title":"Global state evaluation in StarCraft","author":"erickson","year":"0","journal-title":"Proc 6th AAAI Conf Artif Intell Interact Digital Entertain"}],"container-title":["IEEE Transactions on Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7782673\/8318012\/07954767.pdf?arnumber=7954767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:23:40Z","timestamp":1642004620000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7954767\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":19,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tciaig.2017.2717902","relation":{},"ISSN":["2475-1502","2475-1510"],"issn-type":[{"value":"2475-1502","type":"print"},{"value":"2475-1510","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3]]}}}