{"id":"https://openalex.org/W565133072","doi":"https://doi.org/10.5220/0004757603280335","title":"Monte Carlo Tree Search in The Octagon Theory","display_name":"Monte Carlo Tree Search in The Octagon Theory","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W565133072","doi":"https://doi.org/10.5220/0004757603280335","mag":"565133072"},"language":"en","primary_location":{"id":"doi:10.5220/0004757603280335","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004757603280335","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th International Conference on Agents and Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.5220/0004757603280335","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007486427","display_name":"Hugo Fernandes","orcid":"https://orcid.org/0000-0002-0168-4104"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Hugo Fernandes","raw_affiliation_strings":["Faculty of Engineering of the University of Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering of the University of Porto","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025156974","display_name":"Pedro Nogueira","orcid":"https://orcid.org/0000-0002-9646-8438"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Pedro Nogueira","raw_affiliation_strings":["Faculty of Engineering of the University of Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering of the University of Porto","institution_ids":["https://openalex.org/I182534213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100614188","display_name":"Eug\u00e9nio Oliveira","orcid":"https://orcid.org/0000-0001-9271-610X"},"institutions":[{"id":"https://openalex.org/I182534213","display_name":"Universidade do Porto","ror":"https://ror.org/043pwc612","country_code":"PT","type":"education","lineage":["https://openalex.org/I182534213"]}],"countries":["PT"],"is_corresponding":false,"raw_author_name":"Eug\u00e9nio Oliveira","raw_affiliation_strings":["Faculty of Engineering of the University of Porto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Engineering of the University of Porto","institution_ids":["https://openalex.org/I182534213"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.017124,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"328","last_page":"335"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.9991999864578247,"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.9991999864578247,"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.9787999987602234,"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/T10731","display_name":"Educational Games and Gamification","score":0.9513999819755554,"subfield":{"id":"https://openalex.org/subfields/3204","display_name":"Developmental and Educational 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.9507894515991211},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7187575101852417},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.6671455502510071},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.642577052116394},{"id":"https://openalex.org/keywords/game-tree","display_name":"Game tree","score":0.5119231939315796},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.47913500666618347},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.47571665048599243},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4395117163658142},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.43595969676971436},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4323926866054535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.420732319355011},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21703141927719116},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.15671291947364807},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.11633551120758057},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07641926407814026}],"concepts":[{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.9507894515991211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7187575101852417},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.6671455502510071},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.642577052116394},{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.5119231939315796},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.47913500666618347},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.47571665048599243},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4395117163658142},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.43595969676971436},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4323926866054535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.420732319355011},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21703141927719116},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.15671291947364807},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.11633551120758057},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07641926407814026},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.5220/0004757603280335","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004757603280335","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th International Conference on Agents and Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.5220/0004757603280335","is_oa":true,"landing_page_url":"https://doi.org/10.5220/0004757603280335","pdf_url":null,"source":null,"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 6th International Conference on Agents and Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Industry, innovation and infrastructure","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4383535542","https://openalex.org/W3193783858","https://openalex.org/W4383560925","https://openalex.org/W2523674799","https://openalex.org/W1973194029","https://openalex.org/W2102256448","https://openalex.org/W4323526614","https://openalex.org/W2567165815","https://openalex.org/W2999703182","https://openalex.org/W141627066"],"abstract_inverted_index":{"Monte":[0,95],"Carlo":[1,96],"Tree":[2],"Search":[3],"(MCTS)":[4],"is":[5,51,143],"a":[6,120,129],"family":[7],"of":[8,47,72,104,135],"algorithms":[9,61],"known":[10,90],"by":[11],"its":[12],"performance":[13],"in":[14,36,40,75,128],"difficult":[15],"problems":[16,54],"that":[17,101],"cannot":[18],"be":[19,34],"targeted":[20],"with":[21,55,87,131],"the":[22,48,70,76,88,102,139],"current":[23],"technology":[24],"using":[25],"classical":[26],"AI":[27],"approaches.":[28],"Although":[29],"MCTS":[30,73,122],"has":[31],"proven":[32],"to":[33,62],"successful":[35],"various":[37,83],"domains,":[38],"particularly":[39],"deterministic":[41],"board-games":[42],"such":[43],"as":[44],"Go,":[45],"most":[46],"published":[49],"research":[50],"focused":[52],"on":[53],"varying":[56],"lengths,":[57],"causing":[58],"comparisons":[59],"between":[60],"become":[63],"far":[64],"less":[65],"clear.":[66],"This":[67],"paper":[68],"discusses":[69],"application":[71],"techniques":[74],"fixed-length":[77],"game":[78],"The":[79,98],"Octagon":[80],"Theory,":[81],"comparing":[82],"policies":[84],"and":[85,93,115],"enhancements":[86],"best":[89,125],"greedy":[91],"approach":[92],"standard":[94],"Search.":[97],"experiments":[99],"reveal":[100],"usage":[103],"Move":[105],"Groups,":[106],"Decisive":[107],"Moves,":[108],"Upper":[109],"Confidence":[110],"Bounds":[111],"for":[112],"Trees":[113],"(UCT)":[114],"Limited":[116],"Simulation":[117],"Lengths":[118],"turn":[119],"losing":[121],"agent":[123],"into\r\n\r\nthe":[124],"performing":[126],"one":[127],"domain":[130],"estimated":[132],"game-tree":[133],"complexity":[134],"10^293,":[136],"even":[137],"when":[138],"provided":[140],"computational":[141],"budget":[142],"kept":[144],"low.":[145]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}
