{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T17:29:01Z","timestamp":1755797341428,"version":"3.28.0"},"reference-count":27,"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.8848034","type":"proceedings-article","created":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:49:14Z","timestamp":1569548954000},"page":"1-7","source":"Crossref","is-referenced-by-count":14,"title":["Enhancing Monte Carlo Tree Search for Playing Hearthstone"],"prefix":"10.1109","author":[{"given":"Jean Seong Bjorn","family":"Choe","sequence":"first","affiliation":[]},{"given":"Jong-Kook","family":"Kim","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"193","article-title":"A sparse sampling algorithm for near-optimal planning in large MDPs","author":"kearns","year":"1999","journal-title":"IJCAI"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2017.8080446"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2008.5035667"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2011.11.014"},{"key":"ref14","article-title":"Smooth uct search in computer poker","author":"heinrich","year":"2015","journal-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence"},{"key":"ref15","first-page":"134","article-title":"Understanding the Success of Perfect Information Monte Carlo Sampling in Game Tree Search","author":"long","year":"2010","journal-title":"24th AAAI Conf Artif Intell"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2204883"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2012.2200894"},{"key":"ref18","first-page":"2164","article-title":"Monte-Carlo planning in large POMDPs","author":"silver","year":"2010","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref19","first-page":"26","article-title":"Lower Bounding Klondike Solitaire with Monte-Carlo Planning","author":"bjarnason","year":"2009","journal-title":"Proc 19th Int Conf Autom Plan Sched"},{"key":"ref4","first-page":"1","article-title":"Exploring the hearthstone deck space","author":"hoover","year":"2018"},{"article-title":"Tycheagent","year":"0","author":"bornemann","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2016.2536689"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490368"},{"key":"ref5","first-page":"309","article-title":"Improving hearthstone AI by learning highlevel rollout policies and bucketing chance node events","author":"zhang","year":"2017","journal-title":"2017 IEEE Conf Comput Intell Games CIG 2017"},{"key":"ref8","first-page":"282","article-title":"Bandit based monte-carlo planning","author":"kocsis","year":"2006","journal-title":"European Conference on Machine Learning"},{"key":"ref7","first-page":"1145","article-title":"Applying reinforcement learning and supervised learning techniques to play hearthstone","volume":"2018 janua","author":"kachalsky","year":"2018","journal-title":"Proc 16th IEEE Int Conf Mach Learn Appl ICMLA 2017"},{"key":"ref2","first-page":"21","article-title":"Hearthstone deck-construction with a utility system","author":"stiegler","year":"2017","journal-title":"Ski 2016 - 2016 10th Int Conf Software Knowledge Inf Manag Appl"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","article-title":"A Survey of Monte Carlo Tree Search Methods","volume":"4","author":"whitehouse","year":"2012","journal-title":"IEEE Trans Comput Intell AI Games"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490446"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_32"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2018.8490403"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TAAI.2010.38"},{"article-title":"Hearthstone ai competition","year":"0","author":"dockhorn","key":"ref24"},{"article-title":"Sabberstone","year":"0","author":"decoster","key":"ref23"},{"article-title":"Introducing the hearthstone-ai competition","year":"2019","author":"dockhorn","key":"ref26"},{"key":"ref25","first-page":"60","article-title":"Parallel Monte-Carlo Tree Search","volume":"5131","author":"chaslot","year":"2008","journal-title":"Lect Notes Comput Sci (including Subser Lect Notes Artif Intell Lect Notes Bioinformatics)"}],"event":{"name":"2019 IEEE Conference on Games (CoG)","start":{"date-parts":[[2019,8,20]]},"location":"London, United Kingdom","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\/08848034.pdf?arnumber=8848034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T14:50:49Z","timestamp":1658155849000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8848034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/cig.2019.8848034","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}