{"id":"https://openalex.org/W191647388","doi":null,"title":"Improvements and Evaluation of the Monte Carlo Tree Search Algorithm","display_name":"Improvements and Evaluation of the Monte Carlo Tree Search Algorithm","alternate_titles":[],"publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W191647388","mag":"191647388"},"language":"en","primary_location":{"id":"pmh:hdl:10068/837634","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10068/837634","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"U - Thesis"},"parent_works":[],"lineage":["https://openalex.org/W191647388"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/10068/837634","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038266268","display_name":"Arpad Rimmel","orcid":"https://orcid.org/0009-0009-7028-3644","observed_orcids":["https://orcid.org/0009-0009-7028-3644"]},"institutions":[],"countries":[],"is_corresponding":true,"contributor_roles":[],"raw_author_name":"Arpad Rimmel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5038266268"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":3,"reviewed_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9970999956130981,"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.9970999956130981,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.0012000000569969416,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision 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.9449999928474426},{"id":"https://openalex.org/keywords/minimax","display_name":"minimax","score":0.5109999775886536},{"id":"https://openalex.org/keywords/alpha-beta-pruning","display_name":"alpha-beta pruning","score":0.9670000076293945},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9480000138282776},{"id":"https://openalex.org/keywords/parallelization","display_name":"parallelization","score":0.843999981880188},{"id":"https://openalex.org/keywords/go","display_name":"Go","score":0.3880000114440918},{"id":"https://openalex.org/keywords/expert-knowledge","display_name":"expert knowledge","score":0.8019999861717224},{"id":"https://openalex.org/keywords/two-player-games","display_name":"two-player games","score":0.7289999723434448},{"id":"https://openalex.org/keywords/one-player-games","display_name":"one-player games","score":0.6129999756813049},{"id":"https://openalex.org/keywords/graph-problems","display_name":"graph problems","score":0.5249999761581421},{"id":"https://openalex.org/keywords/finite-horizon-planning","display_name":"finite-horizon planning","score":0.6060000061988831},{"id":"https://openalex.org/keywords/discrete-state-space","display_name":"discrete state space","score":0.6579999923706055}],"concepts":[{"id":"https://openalex.org/C15708023","wikidata":"https://www.wikidata.org/wiki/Q80083","display_name":"Humanities","level":1,"score":0.7448965311050415},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.44891130924224854},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3862743079662323},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.350477397441864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27606111764907837},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.26624250411987305},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:hdl:10068/837634","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10068/837634","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"U - Thesis"},{"id":"mag:191647388","doi":null,"is_oa":false,"landing_page_url":"http://www.theses.fr/2009PA112223","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":{"id":"pmh:hdl:10068/837634","doi":null,"is_oa":true,"landing_page_url":"http://hdl.handle.net/10068/837634","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"U - Thesis"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4288290318","https://openalex.org/W4390960828","https://openalex.org/W2039941065","https://openalex.org/W7147076219","https://openalex.org/W1517211955","https://openalex.org/W2070986304","https://openalex.org/W2789108549","https://openalex.org/W2340946512","https://openalex.org/W2919170107"],"abstract_inverted_index":{"Ma":[0],"these":[1,43],"se":[2,119],"situe":[3],"dans":[4,79,90,144,162,169,186,197],"le":[5,80,91,97,110,145,187,212,227],"contexte":[6],"de":[7,29,33,61,72,99,106,125,150,182,209,221,225,230,234,236,251],"la":[8,113,163,170,231],"planification":[9],"a":[10,127,191,200,244],"horizon":[11],"fini":[12],"en":[13,45,217],"environnement":[14],"discret":[15],"avec":[16,63,121,247],"un":[17,93,198,201],"nombre":[18],"d'etats":[19],"trop":[20],"important":[21],"pour":[22,109,135,211],"qu'ils":[23],"soient":[24],"tous":[25],"explores.":[26],"L'objectif":[27],"est":[28,44,115,194],"maximiser":[30],"une":[31,37,59,104,133,137,207,219,248],"fonction":[32],"recompense":[34],"qui":[35,180],"associe":[36],"valeur":[38],"aux":[39],"etats":[40],"finaux.":[41],"Cette":[42,117],"particulier":[46],"centree":[47],"sur":[48,58],"l'amelioration":[49],"et":[50,77,87,140,216],"l'etude":[51],"d'un":[52],"nouvel":[53],"algorithme:":[54],"l'exploration":[55],"d'arbre":[56],"basee":[57],"formule":[60,220],"bandit":[62,222],"evaluation":[64],"Monte":[65,85,172],"Carlo.":[66,173],"Apres":[67],"avoir":[68],"presente":[69],"les":[70,166],"algorithmes":[71],"reference":[73],"du":[74,148],"domaine":[75],"(Minimax":[76],"Alphabeta":[78],"cas":[81,92,111,213],"deux":[82,192],"joueurs;":[83],"Nested":[84],"Carlo":[86],"Programmation":[88],"Dynamique":[89],"joueur),":[94],"je":[95,102,175,205],"decris":[96],"principe":[98],"l'algorithme.":[100],"Puis":[101],"propose":[103,131,206],"methode":[105,118,134,249],"parallelisation":[107,126],"efficace":[108,196],"ou":[112],"memoire":[114,128],"separee.":[116],"combine":[120],"des":[122,157,189,214,240],"methodes":[123],"classiques":[124],"partagee.":[129],"Je":[130],"ensuite":[132],"construire":[136],"base":[138],"d'ouverture":[139],"montre":[141,176],"son":[142],"efficacite":[143],"cadre":[146,188,199],"concret":[147,229],"jeu":[149],"Go.":[151],"J'introduis":[152],"egalement":[153,195],"plusieurs":[154],"manieres":[155],"d'utiliser":[156],"connaissances":[158],"expertes,":[159],"aussi":[160],"bien":[161],"partie":[164,171],"concernant":[165],"bandits":[167],"que":[168,177],"Finalement,":[174],"cet":[178],"algorithme":[179],"donne":[181],"tres":[183],"bons":[184],"resultats":[185,241],"applications":[190],"joueurs":[193],"joueur.":[202],"En":[203],"effet,":[204],"adaptation":[208],"l'algorithme":[210],"graphes":[215],"utilisant":[218],"differente":[223],"afin":[224],"resoudre":[226],"probleme":[228],"generation":[232],"automatique":[233],"librairies":[235],"transformations":[237],"lineaires.":[238],"J'obtiens":[239],"nettement":[242],"superieurs":[243],"ceux":[245],"obtenus":[246],"classique":[250],"programmation":[252],"dynamique.":[253]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W191647388","counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2016-06-24T00:00:00"}
