{"id":"https://openalex.org/W4206302813","doi":"https://doi.org/10.1109/cog52621.2021.9619074","title":"Monte Carlo Tree Search With Reversibility Compression","display_name":"Monte Carlo Tree Search With Reversibility Compression","publication_year":2021,"publication_date":"2021-08-17","ids":{"openalex":"https://openalex.org/W4206302813","doi":"https://doi.org/10.1109/cog52621.2021.9619074"},"language":"en","primary_location":{"id":"doi:10.1109/cog52621.2021.9619074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cog52621.2021.9619074","pdf_url":null,"source":{"id":"https://openalex.org/S4363608335","display_name":"2021 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":"2021 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/A5084471568","display_name":"Michael Cook","orcid":"https://orcid.org/0000-0001-5898-9884"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Michael Cook","raw_affiliation_strings":["School of Electronic Engineering and Computer Science Queen Mary University of London"],"affiliations":[{"raw_affiliation_string":"School of Electronic Engineering and Computer Science Queen Mary University of London","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5084471568"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.377,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.61394653,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"529","issue":null,"first_page":"1","last_page":"8"},"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.9858999848365784,"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/T11674","display_name":"Sports Analytics and Performance","score":0.9855999946594238,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"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.9154993295669556},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.748438835144043},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7129384279251099},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.5971224904060364},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5648998022079468},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5612490773200989},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5434446930885315},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.5022227764129639},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.4887687861919403},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.47870519757270813},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.46083977818489075},{"id":"https://openalex.org/keywords/outcome","display_name":"Outcome (game theory)","score":0.41898685693740845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4160638451576233},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.3829636573791504},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3628794550895691},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3331702947616577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17422634363174438}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.9154993295669556},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.748438835144043},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7129384279251099},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.5971224904060364},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5648998022079468},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5612490773200989},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5434446930885315},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5022227764129639},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.4887687861919403},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.47870519757270813},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.46083977818489075},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.41898685693740845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4160638451576233},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3829636573791504},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3628794550895691},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3331702947616577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17422634363174438},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/cog52621.2021.9619074","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cog52621.2021.9619074","pdf_url":null,"source":{"id":"https://openalex.org/S4363608335","display_name":"2021 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":"2021 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":30,"referenced_works":["https://openalex.org/W135651235","https://openalex.org/W196854640","https://openalex.org/W374967721","https://openalex.org/W1504466744","https://openalex.org/W1557519121","https://openalex.org/W1910077957","https://openalex.org/W1975423918","https://openalex.org/W1991572458","https://openalex.org/W2033697467","https://openalex.org/W2062205231","https://openalex.org/W2115970849","https://openalex.org/W2116123331","https://openalex.org/W2126316555","https://openalex.org/W2140365369","https://openalex.org/W2160237541","https://openalex.org/W2211498769","https://openalex.org/W2257979135","https://openalex.org/W2400316674","https://openalex.org/W2569196563","https://openalex.org/W2572919868","https://openalex.org/W2892810028","https://openalex.org/W2976718034","https://openalex.org/W2977234735","https://openalex.org/W6605583594","https://openalex.org/W6607999367","https://openalex.org/W6612872891","https://openalex.org/W6677426508","https://openalex.org/W6677801406","https://openalex.org/W6731951519","https://openalex.org/W6754930937"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W2358427436","https://openalex.org/W1994919150","https://openalex.org/W4386269615","https://openalex.org/W2064794194","https://openalex.org/W2402589461","https://openalex.org/W4322703856","https://openalex.org/W2115503785","https://openalex.org/W2166539025","https://openalex.org/W1971267722"],"abstract_inverted_index":{"Monte":[0],"Carlo":[1],"Tree":[2],"Search":[3],"(MCTS)":[4],"has":[5,30],"been":[6],"shown":[7],"to":[8,87,126],"be":[9],"an":[10],"effective":[11],"algorithm":[12],"for":[13,138],"solving":[14,139],"search":[15,70,108,113,141],"problems":[16],"in":[17,25,67],"the":[18,35,38,53,82,103,107,116,123],"absence":[19],"of":[20,37,84,97,106,118],"heuristics.":[21],"MCTS":[22,57,74,89],"performs":[23],"best":[24],"spaces":[26],"where":[27],"every":[28],"action":[29,85],"a":[31],"significant":[32,127],"impact":[33,51],"on":[34,52],"outcome":[36],"search.":[39],"In":[40],"many":[41,47],"domains,":[42],"however,":[43],"particularly":[44],"single-player":[45],"games,":[46],"actions":[48],"have":[49],"little":[50],"outcome,":[54],"which":[55,80],"makes":[56],"perform":[58],"poorly":[59],"without":[60,95],"heuristic":[61],"support.":[62],"To":[63],"address":[64],"this":[65],"deficiency":[66],"such":[68],"sparse-impact":[69,140],"problems,":[71],"we":[72],"introduce":[73],"with":[75],"Reversibility":[76],"Compression,":[77],"or":[78],"MCTS-R,":[79],"uses":[81],"notion":[83],"reversibility":[86],"compress":[88],"trees":[90],"as":[91],"they":[92],"are":[93],"constructed,":[94],"loss":[96],"information.":[98],"This":[99],"not":[100],"only":[101],"reduces":[102],"memory":[104],"footprint":[105],"tree,":[109],"but":[110],"also":[111],"accelerates":[112],"by":[114],"preventing":[115],"duplication":[117],"already-explored":[119],"states,":[120],"and":[121],"increasing":[122],"attention":[124],"paid":[125],"actions.":[128],"We":[129],"show":[130],"that":[131],"our":[132],"approach":[133],"outperforms":[134],"several":[135],"comparable":[136],"algorithms":[137],"problems.":[142]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}