{"id":"https://openalex.org/W1973966828","doi":"https://doi.org/10.1109/cig.2014.6932889","title":"Monte Carlo Tree Search variants for simultaneous move games","display_name":"Monte Carlo Tree Search variants for simultaneous move games","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W1973966828","doi":"https://doi.org/10.1109/cig.2014.6932889","mag":"1973966828"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2014.6932889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2014.6932889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Conference on Computational Intelligence and Games","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/A5030655329","display_name":"Mandy J. W. Tak","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Mandy J. W. Tak","raw_affiliation_strings":["Department of Knowledge Engineering, Maastricht University","Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Knowledge Engineering, Maastricht University","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049659586","display_name":"Marc Lanctot","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Marc Lanctot","raw_affiliation_strings":["Department of Knowledge Engineering, Maastricht University","Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Knowledge Engineering, Maastricht University","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013661099","display_name":"Mark H. M. Winands","orcid":"https://orcid.org/0000-0002-0125-0824"},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mark H. M. Winands","raw_affiliation_strings":["Department of Knowledge Engineering, Maastricht University","Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Knowledge Engineering, Maastricht University","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5030655329"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":null,"apc_paid":null,"fwci":2.045,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.88712843,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"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.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.9977999925613403,"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/T11705","display_name":"Gambling Behavior and Treatments","score":0.9843999743461609,"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.9172099828720093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6990965604782104},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6271257996559143},{"id":"https://openalex.org/keywords/regret","display_name":"Regret","score":0.6237484812736511},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.603207528591156},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.5419661998748779},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5390289425849915},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.49738243222236633},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.42444857954978943},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3796633780002594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.364154189825058},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36004990339279175},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.3102768659591675},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2777174115180969},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.2439916431903839},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22990715503692627},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.09047362208366394}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.9172099828720093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6990965604782104},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6271257996559143},{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.6237484812736511},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.603207528591156},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.5419661998748779},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5390289425849915},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.49738243222236633},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42444857954978943},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3796633780002594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.364154189825058},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36004990339279175},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3102768659591675},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2777174115180969},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.2439916431903839},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22990715503692627},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.09047362208366394},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/cig.2014.6932889","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2014.6932889","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Conference on Computational Intelligence and Games","raw_type":"proceedings-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/5e4c8118-4db7-49bf-b12d-d16ee90fe167","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/5e4c8118-4db7-49bf-b12d-d16ee90fe167","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Tak, M J W, Lanctot, M & Winands, M H M 2014, Monte Carlo Tree Search variants for simultaneous move games. in IEEE Conference on Computatonal Intelligence and Games, CIG 2014. IEEE Computer Society, pp. 232-239. https://doi.org/10.1109/CIG.2014.6932889","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:publications/5e4c8118-4db7-49bf-b12d-d16ee90fe167","is_oa":false,"landing_page_url":"http://www.mendeley.com/research/monte-carlo-tree-search-variants-simultaneous-move-games","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tak, M J W, Lanctot, M & Winands, M H M 2014, Monte Carlo Tree Search variants for simultaneous move games. in IEEE Conference on Computatonal Intelligence and Games, CIG 2014. IEEE Computer Society, pp. 232-239. https://doi.org/10.1109/CIG.2014.6932889","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":40,"referenced_works":["https://openalex.org/W57264076","https://openalex.org/W141627066","https://openalex.org/W260397725","https://openalex.org/W1457309686","https://openalex.org/W1504152172","https://openalex.org/W1516840567","https://openalex.org/W1584247264","https://openalex.org/W1589331835","https://openalex.org/W1602705817","https://openalex.org/W1625390266","https://openalex.org/W1714211023","https://openalex.org/W1750339092","https://openalex.org/W2047363889","https://openalex.org/W2048751428","https://openalex.org/W2056740053","https://openalex.org/W2058361071","https://openalex.org/W2090335209","https://openalex.org/W2102256448","https://openalex.org/W2106975967","https://openalex.org/W2113092063","https://openalex.org/W2116067849","https://openalex.org/W2126316555","https://openalex.org/W2126776273","https://openalex.org/W2156078757","https://openalex.org/W2159243063","https://openalex.org/W2168405694","https://openalex.org/W2169487610","https://openalex.org/W2170440413","https://openalex.org/W2255155739","https://openalex.org/W2949431313","https://openalex.org/W3102114426","https://openalex.org/W4240800715","https://openalex.org/W4285719527","https://openalex.org/W4321428174","https://openalex.org/W6605811942","https://openalex.org/W6630853502","https://openalex.org/W6636578284","https://openalex.org/W6637770179","https://openalex.org/W6676175064","https://openalex.org/W6677037278"],"related_works":["https://openalex.org/W10397790","https://openalex.org/W2905819080","https://openalex.org/W4383535542","https://openalex.org/W3193783858","https://openalex.org/W4383560925","https://openalex.org/W1973194029","https://openalex.org/W2523674799","https://openalex.org/W2102256448","https://openalex.org/W4323526614","https://openalex.org/W2567165815"],"abstract_inverted_index":{"Monte":[0],"Carlo":[1],"Tree":[2],"Search":[3],"(MCTS)":[4],"is":[5,30],"a":[6,54],"widely-used":[7],"technique":[8],"for":[9],"game-tree":[10],"search":[11],"in":[12,53],"sequential":[13,124],"turn-based":[14],"games.":[15,40,61],"The":[16,93],"extension":[17],"to":[18,33],"simultaneous":[19,46,59],"move":[20,47,60],"games,":[21],"where":[22],"all":[23],"players":[24],"choose":[25],"moves":[26],"simultaneously":[27],"each":[28,91,101],"turn,":[29],"non-trivial":[31],"due":[32],"the":[34,87,97,106,109,122],"complexity":[35],"of":[36,39,56,90,100],"this":[37,42],"class":[38],"In":[41],"paper,":[43],"we":[44,85],"describe":[45],"MCTS":[48],"and":[49,72,80,84,108,111],"analyze":[50],"its":[51,132],"application":[52],"set":[55],"nine":[57],"disparate":[58],"We":[62],"use":[63],"several":[64],"possible":[65],"variants,":[66],"Decoupled":[67,127],"UCT,":[68,70],"Sequential":[69],"Exp3,":[71],"Regret":[73],"Matching.":[74],"These":[75],"variants":[76],"include":[77],"both":[78],"deterministic":[79],"stochastic":[81],"selection":[82],"strategies":[83],"characterize":[86],"game-play":[88],"performance":[89,99],"one.":[92],"results":[94],"indicate":[95],"that":[96,112],"relative":[98],"variant":[102],"depends":[103],"strongly":[104],"on":[105],"game":[107],"opponent,":[110],"parameter":[113],"tuning":[114],"can":[115],"also":[116],"not":[117],"be":[118],"as":[119,121],"straightforward":[120],"purely":[123],"case.":[125],"Overall,":[126],"UCT":[128],"performs":[129],"best":[130],"despite":[131],"theoretical":[133],"shortcomings.":[134]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}