{"id":"https://openalex.org/W2003861737","doi":"https://doi.org/10.1109/cig.2013.6633646","title":"Recursive Monte Carlo search for imperfect information games","display_name":"Recursive Monte Carlo search for imperfect information games","publication_year":2013,"publication_date":"2013-08-01","ids":{"openalex":"https://openalex.org/W2003861737","doi":"https://doi.org/10.1109/cig.2013.6633646","mag":"2003861737"},"language":"en","primary_location":{"id":"doi:10.1109/cig.2013.6633646","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2013.6633646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Conference on Computational Inteligence in Games (CIG)","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/A5085053889","display_name":"Timothy Furtak","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Timothy Furtak","raw_affiliation_strings":["University of Alberta, Edm Onion, Canada","University of Alberta,Edmonton, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Edm Onion, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta,Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031775706","display_name":"Michael Buro","orcid":"https://orcid.org/0000-0002-5382-7592"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Michael Buro","raw_affiliation_strings":["University of Alberta, Edm Onion, Canada","University of Alberta,Edmonton, AB, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Alberta, Edm Onion, Canada","institution_ids":["https://openalex.org/I154425047"]},{"raw_affiliation_string":"University of Alberta,Edmonton, AB, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":2.0593,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.88068246,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9897000193595886,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.96670001745224,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/perfect-information","display_name":"Perfect information","score":0.8481546640396118},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6923995018005371},{"id":"https://openalex.org/keywords/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.6296460628509521},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.5478909611701965},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.512017548084259},{"id":"https://openalex.org/keywords/imperfect","display_name":"Imperfect","score":0.5090510249137878},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.5049052834510803},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4415295720100403},{"id":"https://openalex.org/keywords/search-problem","display_name":"Search problem","score":0.4141434133052826},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3847290575504303},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3164460062980652},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.19748735427856445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15783876180648804}],"concepts":[{"id":"https://openalex.org/C123676819","wikidata":"https://www.wikidata.org/wiki/Q1074338","display_name":"Perfect information","level":2,"score":0.8481546640396118},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6923995018005371},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.6296460628509521},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.5478909611701965},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.512017548084259},{"id":"https://openalex.org/C2780310539","wikidata":"https://www.wikidata.org/wiki/Q12547192","display_name":"Imperfect","level":2,"score":0.5090510249137878},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.5049052834510803},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4415295720100403},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.4141434133052826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3847290575504303},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3164460062980652},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.19748735427856445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15783876180648804},{"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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":2,"locations":[{"id":"doi:10.1109/cig.2013.6633646","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cig.2013.6633646","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 IEEE Conference on Computational Inteligence in Games (CIG)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.7904","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7904","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eldar.mathstat.uoguelph.ca/dashlock/CIG2013/papers/paper_71.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W56127215","https://openalex.org/W1540121360","https://openalex.org/W1544746353","https://openalex.org/W1575146834","https://openalex.org/W1588577747","https://openalex.org/W1597317312","https://openalex.org/W1625390266","https://openalex.org/W1646839507","https://openalex.org/W2029757490","https://openalex.org/W2077755260","https://openalex.org/W2103315867","https://openalex.org/W2113228754","https://openalex.org/W2145224651","https://openalex.org/W2168405694","https://openalex.org/W2263352300","https://openalex.org/W2295855358","https://openalex.org/W2398499392","https://openalex.org/W2501242903","https://openalex.org/W6602230693","https://openalex.org/W6632284170","https://openalex.org/W6632639835","https://openalex.org/W6635205333","https://openalex.org/W6635737286","https://openalex.org/W6636578284","https://openalex.org/W6636918871","https://openalex.org/W6675509861","https://openalex.org/W6692895827","https://openalex.org/W6712437048"],"related_works":["https://openalex.org/W2360321812","https://openalex.org/W2395295193","https://openalex.org/W3122057932","https://openalex.org/W2909859691","https://openalex.org/W2113798763","https://openalex.org/W3088364074","https://openalex.org/W2004230228","https://openalex.org/W2610227658","https://openalex.org/W2145796981","https://openalex.org/W4322703856"],"abstract_inverted_index":{"Perfect":[0],"information":[1,26,45,69,88,111,127,143],"Monte":[2,89],"Carlo":[3,90],"(PIMC)":[4],"search":[5,21,48,122,135,155],"is":[6,72,156],"the":[7,42,56,62,67,146,157],"method":[8],"of":[9,140,150],"choice":[10],"for":[11,16,152],"constructing":[12],"strong":[13],"Al":[14],"systems":[15],"trick-taking":[17,52],"card":[18,53,148],"games.":[19],"PIMC":[20,47,134,154],"evaluates":[22],"moves":[23,75],"in":[24,51,79,136],"imperfect":[25,87,142],"games":[27,54,144],"by":[28,40,99],"repeatedly":[29],"sampling":[30],"worlds":[31],"based":[32,124],"on":[33,103,125],"state":[34],"inference":[35],"and":[36,145],"estimating":[37],"move":[38,101,112],"values":[39],"solving":[41],"corresponding":[43],"perfect":[44,110,126],"scenarios.":[46],"performs":[49,130],"well":[50],"despite":[55],"fact":[57],"that":[58,116],"it":[59],"suffers":[60],"from":[61],"strategy":[63],"fusion":[64],"problem,":[65],"whereby":[66],"game's":[68],"set":[70],"structure":[71],"ignored":[73],"because":[74],"are":[76],"evaluated":[77],"opportunistically":[78],"each":[80],"world.":[81],"In":[82],"this":[83,97],"paper":[84],"we":[85],"describe":[86],"(IIMC)":[91],"search,":[92],"which":[93,153],"aims":[94],"at":[95],"mitigating":[96],"problem":[98],"basing":[100],"evaluation":[102,128],"more":[104],"realistic":[105],"playout":[106],"sequences":[107],"rather":[108],"than":[109,133],"values.":[113],"We":[114],"show":[115],"RecPIMC":[117],"-":[118,129],"a":[119,137],"recursive":[120],"IIMC":[121],"variant":[123],"considerably":[131],"better":[132],"large":[138],"class":[139],"synthetic":[141],"popular":[147],"game":[149],"Skat,":[151],"state-of-the-art":[158],"cardplay":[159],"algorithm.":[160]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}