{"id":"https://openalex.org/W3116200192","doi":"https://doi.org/10.1109/tg.2020.3048331","title":"More Trees or Larger Trees: Parallelizing Monte Carlo Tree Search","display_name":"More Trees or Larger Trees: Parallelizing Monte Carlo Tree Search","publication_year":2020,"publication_date":"2020-12-30","ids":{"openalex":"https://openalex.org/W3116200192","doi":"https://doi.org/10.1109/tg.2020.3048331","mag":"3116200192"},"language":"en","primary_location":{"id":"doi:10.1109/tg.2020.3048331","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tg.2020.3048331","pdf_url":null,"source":{"id":"https://openalex.org/S4210224842","display_name":"IEEE Transactions on Games","issn_l":"2475-1502","issn":["2475-1502","2475-1510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Games","raw_type":"journal-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/A5085313636","display_name":"Erik S. Steinmetz","orcid":"https://orcid.org/0000-0002-0368-3332"},"institutions":[{"id":"https://openalex.org/I119916105","display_name":"Augsburg University","ror":"https://ror.org/057ewhh68","country_code":"US","type":"education","lineage":["https://openalex.org/I119916105"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Erik Steinmetz","raw_affiliation_strings":["Department of Computer Science, Augsburg University, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0002-0368-3332","affiliations":[{"raw_affiliation_string":"Department of Computer Science, Augsburg University, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I119916105"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016462041","display_name":"Maria Gini","orcid":"https://orcid.org/0000-0001-8841-1055"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Maria Gini","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA"],"raw_orcid":"https://orcid.org/0000-0001-8841-1055","affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5085313636"],"corresponding_institution_ids":["https://openalex.org/I119916105"],"apc_list":null,"apc_paid":null,"fwci":0.9512,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.81822859,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"13","issue":"3","first_page":"315","last_page":"320"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9997000098228455,"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.9997000098228455,"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/T11674","display_name":"Sports Analytics and Performance","score":0.9932000041007996,"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"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9857000112533569,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8215489387512207},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.7287371754646301},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6521981358528137},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.60917729139328},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5980513095855713},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.5915024876594543},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5860627293586731},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5060974955558777},{"id":"https://openalex.org/keywords/root","display_name":"Root (linguistics)","score":0.4810938537120819},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.44035080075263977},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.4142165184020996},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3749290108680725},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.373581200838089},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.232566237449646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13752508163452148},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12057587504386902},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07989633083343506}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8215489387512207},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.7287371754646301},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6521981358528137},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.60917729139328},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5980513095855713},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.5915024876594543},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5860627293586731},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5060974955558777},{"id":"https://openalex.org/C171078966","wikidata":"https://www.wikidata.org/wiki/Q111029","display_name":"Root (linguistics)","level":2,"score":0.4810938537120819},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.44035080075263977},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.4142165184020996},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3749290108680725},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.373581200838089},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.232566237449646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13752508163452148},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12057587504386902},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07989633083343506},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tg.2020.3048331","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tg.2020.3048331","pdf_url":null,"source":{"id":"https://openalex.org/S4210224842","display_name":"IEEE Transactions on Games","issn_l":"2475-1502","issn":["2475-1502","2475-1510"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Games","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W11003735","https://openalex.org/W25268328","https://openalex.org/W41360574","https://openalex.org/W115012109","https://openalex.org/W202421935","https://openalex.org/W562242262","https://openalex.org/W1524244278","https://openalex.org/W1528097685","https://openalex.org/W1551466210","https://openalex.org/W1573483709","https://openalex.org/W1625390266","https://openalex.org/W1714211023","https://openalex.org/W1997840820","https://openalex.org/W2038245069","https://openalex.org/W2101101673","https://openalex.org/W2123932647","https://openalex.org/W2126316555","https://openalex.org/W2134400955","https://openalex.org/W2136050130","https://openalex.org/W2148036086","https://openalex.org/W2163413133","https://openalex.org/W2213171681","https://openalex.org/W2257979135","https://openalex.org/W2260381424","https://openalex.org/W2295465200","https://openalex.org/W2461333303","https://openalex.org/W2557231438","https://openalex.org/W2614010283","https://openalex.org/W2766447205","https://openalex.org/W2790410705","https://openalex.org/W2806809829","https://openalex.org/W2995336719","https://openalex.org/W3014329170","https://openalex.org/W3142540905","https://openalex.org/W4287822789","https://openalex.org/W6600441890","https://openalex.org/W6601048435","https://openalex.org/W6601711263","https://openalex.org/W6683796152","https://openalex.org/W6688201039","https://openalex.org/W6692568836","https://openalex.org/W6730253012","https://openalex.org/W6767755005","https://openalex.org/W6775166771","https://openalex.org/W6792851857"],"related_works":["https://openalex.org/W1500978221","https://openalex.org/W2770627170","https://openalex.org/W2978000411","https://openalex.org/W4206302813","https://openalex.org/W4327811054","https://openalex.org/W2491631281","https://openalex.org/W2967025328","https://openalex.org/W1785631772","https://openalex.org/W2962865140","https://openalex.org/W4389302168"],"abstract_inverted_index":{"Monte":[0],"Carlo":[1],"tree":[2,37],"search":[3],"(MCTS)":[4],"is":[5,52],"being":[6],"effectively":[7],"used":[8],"in":[9,24,78],"many":[10,25],"domains,":[11],"but":[12],"acquiring":[13],"good":[14],"results":[15,48,57,64,75,95],"from":[16,66],"building":[17,38],"larger":[18],"trees":[19,43],"takes":[20],"time":[21,51],"that":[22,34],"can":[23,46],"cases":[26],"be":[27],"impractical.":[28],"In":[29],"this":[30],"article,":[31],"we":[32],"show":[33],"parallelizing":[35],"the":[36,79,86],"process":[39],"using":[40,76],"multiple":[41],"independent":[42],"(root":[44],"parallelization)":[45],"improve":[47],"when":[49],"limited":[50],"available,":[53],"and":[54,62,99],"compare":[55],"these":[56],"to":[58,63,91],"other":[59],"parallelization":[60],"techniques":[61],"obtained":[65,73],"running":[67],"for":[68],"an":[69],"extended":[70],"time.":[71],"We":[72],"our":[74,94],"MCTS":[77],"domain":[80],"of":[81],"computer":[82],"Go,":[83],"which":[84],"has":[85],"most":[87],"mature":[88],"implementations.":[89],"Compared":[90],"previous":[92],"studies,":[93],"are":[96],"more":[97],"precise":[98],"statistically":[100],"significant.":[101]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}