{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,9]],"date-time":"2025-05-09T12:29:14Z","timestamp":1746793754962},"reference-count":14,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T00:00:00Z","timestamp":1564617600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1109\/cig.2019.8848026","type":"proceedings-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:49:14Z","timestamp":1569548954000},"source":"Crossref","is-referenced-by-count":10,"title":["Hyperstate Space Graphs for Automated Game Analysis"],"prefix":"10.1109","author":[{"given":"Michael","family":"Cook","sequence":"first","affiliation":[]},{"given":"Azalea","family":"Raad","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490363"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(75)90019-3"},{"key":"ref12","article-title":"Depth in strategic games","author":"lantz","year":"2017","journal-title":"Proceedings of the 31st AAAI Conference on Artificial Intelligence"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633610"},{"key":"ref14","author":"smith","year":"2014","journal-title":"Strategy headroom in roguelikes NetHack 4 Development Blog"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2186810"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2010.2041928"},{"key":"ref6","article-title":"Redesigning computationally creative systems for continuous creation","author":"cook","year":"2018","journal-title":"Proceedings of the Ninth International Conference on Computational Creativity"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1040.0145"},{"key":"ref8","author":"francis","year":"2014","journal-title":"What works and why Invisible inc"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1814256.1814257"},{"key":"ref2","article-title":"Matching games and algorithms for general video game playing","author":"bontrager","year":"2016","journal-title":"Proceedings of the Twelfth AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment"},{"key":"ref1","article-title":"Searching for Solutions in Games and Artificial Intelligence","author":"victor allis","year":"1994","journal-title":"PhD thesis"},{"key":"ref9","article-title":"Using an Algorithm Portfolio to Solve Sokoban","author":"froleyks","year":"2016","journal-title":"PhD thesis"}],"event":{"name":"2019 IEEE Conference on Games (CoG)","location":"London, United Kingdom","start":{"date-parts":[[2019,8,20]]},"end":{"date-parts":[[2019,8,23]]}},"container-title":["2019 IEEE Conference on Games (CoG)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8844551\/8847948\/08848026.pdf?arnumber=8848026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:51:30Z","timestamp":1658155890000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8848026\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/cig.2019.8848026","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}