{"id":"https://openalex.org/W2029572069","doi":"https://doi.org/10.1109/cig.2014.6932903","title":"Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups","display_name":"Monte Carlo Tree Search with heuristic evaluations using implicit minimax backups","publication_year":2014,"publication_date":"2014-08-01","ids":{"openalex":"https://openalex.org/W2029572069","doi":"https://doi.org/10.1109/cig.2014.6932903","mag":"2029572069"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2014.6932903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2014.6932903","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":"conference-paper","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/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#"],"raw_orcid":null,"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/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#"],"raw_orcid":null,"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/A5036250489","display_name":"Tom Pepels","orcid":"https://orcid.org/0009-0007-1437-0693"},"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":"Tom Pepels","raw_affiliation_strings":["Department of Knowledge Engineering, Maastricht University","Games and AI Group, Department of Knowledge Engineering, Maastricht University, The Netherlands#TAB#"],"raw_orcid":null,"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/A5041415709","display_name":"Nathan Sturtevant","orcid":"https://orcid.org/0000-0003-4318-2791"},"institutions":[{"id":"https://openalex.org/I131651094","display_name":"University of Denver","ror":"https://ror.org/04w7skc03","country_code":"US","type":"education","lineage":["https://openalex.org/I131651094"]},{"id":"https://openalex.org/I4210156583","display_name":"Laboratoire d'Informatique de Paris-Nord","ror":"https://ror.org/05g1zjw44","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I4210091279","https://openalex.org/I4210156583","https://openalex.org/I4210159245"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Nathan R. Sturtevant","raw_affiliation_strings":["Computer Science Department, University of Denver","Computer Science Department, University of Denver, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Denver","institution_ids":["https://openalex.org/I131651094","https://openalex.org/I4210156583"]},{"raw_affiliation_string":"Computer Science Department, University of Denver, The Netherlands","institution_ids":["https://openalex.org/I131651094"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"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.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.9972000122070312,"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.9908999800682068,"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.926697850227356},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7967503070831299},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7626081705093384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7206340432167053},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.6179805994033813},{"id":"https://openalex.org/keywords/null-move-heuristic","display_name":"Null-move heuristic","score":0.5584530234336853},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.5424720644950867},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5287582278251648},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5097424387931824},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.4983372688293457},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4885502755641937},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4081392288208008},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.40382054448127747},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3895002603530884},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3807953894138336},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.3205111622810364},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31089311838150024},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2169714868068695},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.11075964570045471},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.09987139701843262},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.093441903591156}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.926697850227356},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7967503070831299},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7626081705093384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7206340432167053},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.6179805994033813},{"id":"https://openalex.org/C114290370","wikidata":"https://www.wikidata.org/wiki/Q1415915","display_name":"Null-move heuristic","level":3,"score":0.5584530234336853},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.5424720644950867},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5287582278251648},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5097424387931824},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.4983372688293457},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4885502755641937},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4081392288208008},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.40382054448127747},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3895002603530884},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3807953894138336},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3205111622810364},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31089311838150024},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2169714868068695},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.11075964570045471},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.09987139701843262},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.093441903591156},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cig.2014.6932903","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2014.6932903","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/fc6e8c61-dbab-4477-8e96-130528a3c3cd","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/fc6e8c61-dbab-4477-8e96-130528a3c3cd","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":"Lanctot, M, Winands, M H M, Pepels, T & Sturtevant, N R 2014, Monte carlo tree search with heuristic evaluations using implicit minimax backups. in IEEE Conference on Computatonal Intelligence and Games, CIG. IEEE Computer Society, pp. 341-348. https://doi.org/10.1109/CIG.2014.6932903","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":48,"referenced_works":["https://openalex.org/W57264076","https://openalex.org/W58433569","https://openalex.org/W116070103","https://openalex.org/W420247093","https://openalex.org/W1479779129","https://openalex.org/W1492044600","https://openalex.org/W1494093857","https://openalex.org/W1537258144","https://openalex.org/W1562623050","https://openalex.org/W1575146834","https://openalex.org/W1603772156","https://openalex.org/W1619459736","https://openalex.org/W1625390266","https://openalex.org/W1658022593","https://openalex.org/W1714211023","https://openalex.org/W1821581985","https://openalex.org/W1955510565","https://openalex.org/W1968887996","https://openalex.org/W2016647253","https://openalex.org/W2020135152","https://openalex.org/W2029572069","https://openalex.org/W2030705305","https://openalex.org/W2075848246","https://openalex.org/W2112583639","https://openalex.org/W2114735315","https://openalex.org/W2126116362","https://openalex.org/W2126316555","https://openalex.org/W2143610817","https://openalex.org/W2149523275","https://openalex.org/W2168405694","https://openalex.org/W2295855358","https://openalex.org/W2342815765","https://openalex.org/W2394632060","https://openalex.org/W2588766006","https://openalex.org/W2950757557","https://openalex.org/W4212953028","https://openalex.org/W4230137713","https://openalex.org/W4238356594","https://openalex.org/W6604690457","https://openalex.org/W6629539993","https://openalex.org/W6636038547","https://openalex.org/W6637441126","https://openalex.org/W6638530903","https://openalex.org/W6677041917","https://openalex.org/W6679223551","https://openalex.org/W6763470677","https://openalex.org/W6820714983","https://openalex.org/W7027963530"],"related_works":["https://openalex.org/W2081821176","https://openalex.org/W3111117784","https://openalex.org/W2400861930","https://openalex.org/W2097038466","https://openalex.org/W2573689326","https://openalex.org/W1973194029","https://openalex.org/W2376959332","https://openalex.org/W2224555876","https://openalex.org/W2733854862","https://openalex.org/W2029572069"],"abstract_inverted_index":{"Monte":[0],"Carlo":[1],"Tree":[2],"Search":[3],"(MCTS)":[4],"has":[5,23,52],"improved":[6],"the":[7,83,88,103,108,117],"performance":[8,141],"of":[9,64,91,147],"game":[10,20],"engines":[11],"in":[12,31,50,58,142],"domains":[13],"such":[14,61],"as":[15,62],"Go,":[16],"Hex,":[17],"and":[18,67,96,145],"general":[19],"playing.":[21],"MCTS":[22,51,84,118],"been":[24,53],"shown":[25,54],"to":[26,39,55,77,81,106,126,138],"outperform":[27],"classic":[28],"\u03b1\u03b2":[29],"search":[30,49,85],"games":[32],"where":[33],"good":[34],"heuristic":[35,79,97,104],"evaluations":[36,80,105],"are":[37,123],"difficult":[38],"obtain.":[40],"In":[41,69],"recent":[42],"years,":[43],"combining":[44],"ideas":[45],"from":[46],"traditional":[47],"minimax":[48,121,135],"be":[56],"advantageous":[57],"some":[59],"domains,":[60],"Lines":[63,146],"Action,":[65],"Amazons,":[66],"Breakthrough.":[68],"this":[70],"paper,":[71],"we":[72],"propose":[73],"a":[74],"new":[75],"way":[76],"use":[78],"guide":[82,127],"by":[86],"storing":[87],"two":[89],"sources":[90],"information,":[92],"estimated":[93],"win":[94],"rates":[95],"evaluations,":[98],"separately.":[99],"Rather":[100],"than":[101],"using":[102,133],"replace":[107],"playouts,":[109],"our":[110],"technique":[111],"backs":[112],"them":[113],"up":[114],"implicitly":[115],"during":[116],"simulations.":[119,129],"These":[120],"values":[122],"then":[124],"used":[125],"future":[128],"We":[130],"show":[131],"that":[132],"implicit":[134],"backups":[136],"leads":[137],"stronger":[139],"play":[140],"Kalah,":[143],"Breakthrough,":[144],"Action.":[148]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}