{"id":"https://openalex.org/W2112583639","doi":"https://doi.org/10.1109/tciaig.2010.2061050","title":"Monte Carlo Tree Search in Lines of Action","display_name":"Monte Carlo Tree Search in Lines of Action","publication_year":2010,"publication_date":"2010-07-29","ids":{"openalex":"https://openalex.org/W2112583639","doi":"https://doi.org/10.1109/tciaig.2010.2061050","mag":"2112583639"},"language":"en","primary_location":{"id":"doi:10.1109/tciaig.2010.2061050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tciaig.2010.2061050","pdf_url":null,"source":{"id":"https://openalex.org/S4210179349","display_name":"IEEE Transactions on Computational Intelligence and AI in Games","issn_l":"1943-068X","issn":["1943-068X","1943-0698"],"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 Computational Intelligence and AI in 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/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":true,"raw_author_name":"Mark H. M. Winands","raw_affiliation_strings":["Department of Knowledge Engineering, Faculty of Humanities and Sciences, University of Maastricht, Maastricht, Netherlands","Department of Knowledge Engineering, Maastricht University, Maastricht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Knowledge Engineering, Faculty of Humanities and Sciences, University of Maastricht, Maastricht, Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Knowledge Engineering, Maastricht University, Maastricht, Netherlands","institution_ids":["https://openalex.org/I34352273"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026895150","display_name":"Yngvi Bj\u00f6rnsson","orcid":null},"institutions":[{"id":"https://openalex.org/I123185442","display_name":"Reykjav\u00edk University","ror":"https://ror.org/05d2kyx68","country_code":"IS","type":"education","lineage":["https://openalex.org/I123185442"]}],"countries":["IS"],"is_corresponding":false,"raw_author_name":"Yngvi Bjornsson","raw_affiliation_strings":["School of Computer Science, Reykjav\u00edk University, Reykjavik, Iceland","School of Computer Science, Reykjavik University, Reykjav\u00edk, Iceland#TAB#"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Reykjav\u00edk University, Reykjavik, Iceland","institution_ids":["https://openalex.org/I123185442"]},{"raw_affiliation_string":"School of Computer Science, Reykjavik University, Reykjav\u00edk, Iceland#TAB#","institution_ids":["https://openalex.org/I123185442"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058442599","display_name":"Jahn-Takeshi Saito","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":"Jahn-Takeshi Saito","raw_affiliation_strings":["Department of Knowledge Engineering, Faculty of Humanities and Sciences, University of Maastricht, Maastricht, Netherlands","Department of Knowledge Engineering, Maastricht University, Maastricht, Netherlands"],"affiliations":[{"raw_affiliation_string":"Department of Knowledge Engineering, Faculty of Humanities and Sciences, University of Maastricht, Maastricht, Netherlands","institution_ids":["https://openalex.org/I34352273"]},{"raw_affiliation_string":"Department of Knowledge Engineering, Maastricht University, Maastricht, Netherlands","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5013661099"],"corresponding_institution_ids":["https://openalex.org/I34352273"],"apc_list":null,"apc_paid":null,"fwci":11.1716,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.98389479,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"2","issue":"4","first_page":"239","last_page":"250"},"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/T11674","display_name":"Sports Analytics and Performance","score":0.994700014591217,"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/T11197","display_name":"Digital Games and Media","score":0.9908999800682068,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.9648568630218506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.786199152469635},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6281102895736694},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.6018728613853455},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5447980761528015},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4694271683692932},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.46248847246170044},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.4462597370147705},{"id":"https://openalex.org/keywords/iterative-deepening-depth-first-search","display_name":"Iterative deepening depth-first search","score":0.41007089614868164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3617938160896301},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.3016468584537506},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.2871466279029846},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20819246768951416},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.1935303807258606},{"id":"https://openalex.org/keywords/incremental-heuristic-search","display_name":"Incremental heuristic search","score":0.14444652199745178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10555469989776611}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.9648568630218506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.786199152469635},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6281102895736694},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.6018728613853455},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5447980761528015},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4694271683692932},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.46248847246170044},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.4462597370147705},{"id":"https://openalex.org/C14362708","wikidata":"https://www.wikidata.org/wiki/Q1675274","display_name":"Iterative deepening depth-first search","level":5,"score":0.41007089614868164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3617938160896301},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.3016468584537506},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.2871466279029846},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20819246768951416},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.1935303807258606},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.14444652199745178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10555469989776611},{"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/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":3,"locations":[{"id":"doi:10.1109/tciaig.2010.2061050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tciaig.2010.2061050","pdf_url":null,"source":{"id":"https://openalex.org/S4210179349","display_name":"IEEE Transactions on Computational Intelligence and AI in Games","issn_l":"1943-068X","issn":["1943-068X","1943-0698"],"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 Computational Intelligence and AI in Games","raw_type":"journal-article"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire_cris_publications/d954d428-4991-4221-a89e-46583ff69757","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/d954d428-4991-4221-a89e-46583ff69757","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":"Winands, M H M, Bj\u00f6rnsson, Y & Saito, J-T 2010, 'Monte Carlo Tree Search in Lines of Action', IEEE Transactions on Computational Intelligence and AI in Games, vol. 2, no. 4, pp. 239-250. https://doi.org/10.1109/TCIAIG.2010.2061050","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.466.1464","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.466.1464","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ru.is/faculty/yngvi/pdf/WinandsB10a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320324004","display_name":"Forskningsr\u00e5det om H\u00e4lsa, Arbetsliv och V\u00e4lf\u00e4rd","ror":"https://ror.org/02d290r06"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":60,"referenced_works":["https://openalex.org/W92300846","https://openalex.org/W130194120","https://openalex.org/W150242499","https://openalex.org/W158031290","https://openalex.org/W198270232","https://openalex.org/W1484300086","https://openalex.org/W1487665600","https://openalex.org/W1492706321","https://openalex.org/W1494093857","https://openalex.org/W1507823407","https://openalex.org/W1512315140","https://openalex.org/W1526187220","https://openalex.org/W1528097685","https://openalex.org/W1529044303","https://openalex.org/W1530140606","https://openalex.org/W1540121360","https://openalex.org/W1549568111","https://openalex.org/W1551466210","https://openalex.org/W1560633239","https://openalex.org/W1573483709","https://openalex.org/W1603772156","https://openalex.org/W1625390266","https://openalex.org/W1635144297","https://openalex.org/W1714211023","https://openalex.org/W1863869622","https://openalex.org/W1982236629","https://openalex.org/W1991068790","https://openalex.org/W1997064301","https://openalex.org/W1999274520","https://openalex.org/W2020135152","https://openalex.org/W2028581371","https://openalex.org/W2042584910","https://openalex.org/W2042822538","https://openalex.org/W2074024590","https://openalex.org/W2075848246","https://openalex.org/W2107549951","https://openalex.org/W2109554237","https://openalex.org/W2112583639","https://openalex.org/W2113776978","https://openalex.org/W2122659384","https://openalex.org/W2126116362","https://openalex.org/W2152642143","https://openalex.org/W2199313268","https://openalex.org/W2496767677","https://openalex.org/W2606635085","https://openalex.org/W2805073284","https://openalex.org/W2970412811","https://openalex.org/W3142540905","https://openalex.org/W4247219007","https://openalex.org/W4285719527","https://openalex.org/W4299364153","https://openalex.org/W6606334613","https://openalex.org/W6629105393","https://openalex.org/W6632284170","https://openalex.org/W6633461654","https://openalex.org/W6676106908","https://openalex.org/W6678029071","https://openalex.org/W6679223551","https://openalex.org/W6687442040","https://openalex.org/W6792851857"],"related_works":["https://openalex.org/W2978000411","https://openalex.org/W2115503785","https://openalex.org/W4383535542","https://openalex.org/W4322703856","https://openalex.org/W4293919576","https://openalex.org/W2112583639","https://openalex.org/W1598522239","https://openalex.org/W1113434642","https://openalex.org/W1990386132","https://openalex.org/W2093099531"],"abstract_inverted_index":{"The":[0,41,100],"success":[1],"of":[2,43,82,94,116],"Monte":[3,21],"Carlo":[4,22],"tree":[5,121],"search":[6,13,30,37,45,120,173],"(MCTS)":[7],"in":[8,31,118,133,136],"many":[9,93],"games,":[10],"where":[11,34,59],"\u03b1\u03b2-based":[12,44,159],"has":[14,175],"failed,":[15],"naturally":[16],"raises":[17],"the":[18,79,95,113,145,156,170,180],"question":[19],"whether":[20],"simulations":[23,126,134],"will":[24],"eventually":[25],"also":[26],"outperform":[27,154],"traditional":[28,171],"game-tree":[29,172],"game":[32,50,80,91,142],"domains":[33,51],"\u03b1\u03b2":[35],"-based":[36],"is":[38,86,151,163],"now":[39],"successful.":[40],"forte":[42],"are":[46],"highly":[47,88],"tactical":[48,89],"deterministic":[49],"with":[52],"a":[53,87,119],"small":[54],"to":[55,110,123,153,178],"moderate":[56],"branching":[57],"factor,":[58],"efficient":[60],"yet":[61],"knowledge-rich":[62],"evaluation":[63],"functions":[64],"can":[65],"be":[66,179],"applied":[67],"effectively.":[68],"In":[69],"this":[70],"paper,":[71],"we":[72],"describe":[73],"an":[74,103,164],"MCTS-based":[75],"program":[76,101,150],"for":[77,98,167,183],"playing":[78,184],"Lines":[81],"Action":[83],"(LOA),":[84],"which":[85],"slow-progression":[90],"exhibiting":[92],"properties":[96],"difficult":[97],"MCTS.":[99],"uses":[102],"improved":[104,146],"MCTS":[105,147,168],"variant":[106],"that":[107],"allows":[108],"it":[109],"both":[111,137],"prove":[112],"game-theoretical":[114],"value":[115],"nodes":[117],"and":[122,140],"focus":[124],"its":[125],"better":[127,181],"using":[128],"domain":[129],"knowledge.":[130],"This":[131,162],"results":[132],"superior":[135],"handling":[138],"tactics":[139],"ensuring":[141],"progression.":[143],"Using":[144],"variant,":[148],"our":[149],"able":[152],"even":[155],"world's":[157],"strongest":[158],"LOA":[160],"program.":[161],"important":[165],"milestone":[166],"because":[169],"approach":[174],"been":[176],"considered":[177],"suited":[182],"LOA.":[185]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":6},{"year":2016,"cited_by_count":10},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}