{"id":"https://openalex.org/W2975858923","doi":"https://doi.org/10.1109/cig.2019.8848034","title":"Enhancing Monte Carlo Tree Search for Playing Hearthstone","display_name":"Enhancing Monte Carlo Tree Search for Playing Hearthstone","publication_year":2019,"publication_date":"2019-08-01","ids":{"openalex":"https://openalex.org/W2975858923","doi":"https://doi.org/10.1109/cig.2019.8848034","mag":"2975858923"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2019.8848034","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2019.8848034","pdf_url":null,"source":{"id":"https://openalex.org/S4306498491","display_name":"2019 IEEE Conference on Games (CoG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Conference on Games (CoG)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5025797799","display_name":"Jean Seong Bjorn Choe","orcid":null},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Jean Seong Bjorn Choe","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018364461","display_name":"Jong\u2010Kook Kim","orcid":"https://orcid.org/0000-0003-1828-7807"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jong-Kook Kim","raw_affiliation_strings":["School of Electrical Engineering, Korea University, Seoul, South Korea"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Korea University, Seoul, South Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5025797799"],"corresponding_institution_ids":["https://openalex.org/I197347611"],"apc_list":null,"apc_paid":null,"fwci":1.5742,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.87420737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11197","display_name":"Digital Games and Media","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/3312","display_name":"Sociology and Political Science"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11705","display_name":"Gambling Behavior and Treatments","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/3203","display_name":"Clinical Psychology"},"field":{"id":"https://openalex.org/fields/32","display_name":"Psychology"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.880804717540741},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7034463882446289},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5300891995429993},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5050984025001526},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44847509264945984},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44225066900253296},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4364716708660126},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.43357789516448975},{"id":"https://openalex.org/keywords/best-first-search","display_name":"Best-first search","score":0.41387292742729187},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.4113704264163971},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4055699110031128},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3352758288383484},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21564564108848572}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.880804717540741},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7034463882446289},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5300891995429993},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5050984025001526},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44847509264945984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44225066900253296},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4364716708660126},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.43357789516448975},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.41387292742729187},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.4113704264163971},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4055699110031128},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3352758288383484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21564564108848572},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cig.2019.8848034","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2019.8848034","pdf_url":null,"source":{"id":"https://openalex.org/S4306498491","display_name":"2019 IEEE Conference on Games (CoG)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Conference on Games (CoG)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W107054272","https://openalex.org/W1573483709","https://openalex.org/W1625390266","https://openalex.org/W1646839507","https://openalex.org/W2077755260","https://openalex.org/W2113228754","https://openalex.org/W2126316555","https://openalex.org/W2140365369","https://openalex.org/W2168061500","https://openalex.org/W2168165432","https://openalex.org/W2171084228","https://openalex.org/W2291772168","https://openalex.org/W2327248735","https://openalex.org/W2610331246","https://openalex.org/W2766259847","https://openalex.org/W2767141304","https://openalex.org/W2783024579","https://openalex.org/W2885766801","https://openalex.org/W2890062381","https://openalex.org/W2896873963","https://openalex.org/W2953334285","https://openalex.org/W2963395499","https://openalex.org/W2985927024","https://openalex.org/W6634471212","https://openalex.org/W6636578284","https://openalex.org/W6636918871","https://openalex.org/W6684902637","https://openalex.org/W6684973485","https://openalex.org/W6697063336","https://openalex.org/W6737177696","https://openalex.org/W6745841225","https://openalex.org/W6748117716","https://openalex.org/W6764873643"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2064794194","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4200104947","https://openalex.org/W2224555876","https://openalex.org/W1622225657","https://openalex.org/W2402589461","https://openalex.org/W4386269615","https://openalex.org/W4322703856"],"abstract_inverted_index":{"Hearthstone":[0,9,182],"is":[1,44,63,90,191],"a":[2,15,23,27,58,67,133,140,196],"popular":[3],"online":[4],"collectible":[5],"card":[6],"game":[7,20],"(CCG).":[8],"imposes":[10],"interesting":[11],"challenges":[12],"in":[13],"developing":[14,195],"search":[16,81,88,114,130],"algorithm":[17,149,159],"for":[18,146,150,181,194],"the":[19,41,83,87,98,110,113,119,129,151,156,168,178,184],"AI.":[21],"As":[22],"CCG,":[24],"it":[25],"has":[26],"considerable":[28],"amount":[29],"of":[30,46,57,73,86,100,112,142,177],"hidden":[31],"information":[32,163],"from":[33],"each":[34,61],"player\u2019s":[35],"private":[36],"hand":[37],"and":[38,116,138,164,166,183],"deck.":[39],"Moreover,":[40],"action":[42],"space":[43,89,115,131],"full":[45],"stochastic":[47,169],"actions":[48],"compared":[49],"to":[50,65,108,127,160],"other":[51],"similar":[52],"games.":[53],"That":[54],"is,":[55],"instead":[56],"single":[59],"move,":[60],"player":[62],"allowed":[64],"build":[66],"move":[68],"sequence":[69],"via":[70],"various":[71],"combinations":[72],"atomic":[74],"actions.":[75],"Therefore,":[76],"when":[77],"applying":[78],"any":[79],"heuristic":[80],"algorithm,":[82],"branching":[84,170],"factor":[85],"extremely":[91],"large.":[92],"In":[93],"this":[94],"paper,":[95],"we":[96,123,154],"explore":[97],"use":[99],"Monte":[101],"Carlo":[102],"Tree":[103],"Search":[104],"(MCTS)":[105],"with":[106],"approaches":[107],"reduce":[109,167],"complexity":[111],"decide":[117],"on":[118],"best":[120],"strategy.":[121],"First,":[122],"utilise":[124],"state":[125],"abstraction":[126],"present":[128],"as":[132],"Directed":[134],"Acyclic":[135],"Graph":[136],"(DAG)":[137],"introduce":[139],"variant":[141],"Upper":[143],"Confidence":[144],"Bound":[145],"Trees":[147],"(UCT)":[148],"DAG.":[152],"Next,":[153],"apply":[155],"sparse":[157],"sampling":[158],"handle":[161],"imperfect":[162],"randomness":[165],"factor.":[171],"This":[172],"paper":[173],"presents":[174],"empirical":[175],"evaluations":[176],"proposed":[179],"framework":[180],"experimental":[185],"results":[186],"suggest":[187],"that":[188],"our":[189],"approach":[190],"well":[192],"suited":[193],"better":[197],"AI":[198],"agent.":[199]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}