{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/monte-carlo-tree-search-for-asymmetric-trees","title":"Monte Carlo Tree Search for Asymmetric Trees","arxiv_id":"1805.09218","date":"2018-05-23","proceeding":null,"authors":["Thomas M. Moerland","Joost Broekens","Aske Plaat","Catholijn M. Jonker"],"abstract":"We present an extension of Monte Carlo Tree Search (MCTS) that strongly\nincreases its efficiency for trees with asymmetry and/or loops. Asymmetric\ntermination of search trees introduces a type of uncertainty for which the\nstandard upper confidence bound (UCB) formula does not account. Our first\nalgorithm (MCTS-T), which assumes a non-stochastic environment, backs-up tree\nstructure uncertainty and leverages it for exploration in a modified UCB\nformula. Results show vastly improved efficiency in a well-known asymmetric\ndomain in which MCTS performs arbitrarily bad. Next, we connect the ideas about\nasymmetric termination to the presence of loops in the tree, where the same\nstate appears multiple times in a single trace. An extension to our algorithm\n(MCTS-T+), which in addition to non-stochasticity assumes full state\nobservability, further increases search efficiency for domains with loops as\nwell. Benchmark testing on a set of OpenAI Gym and Atari 2600 games indicates\nthat our algorithms always perform better than or at least equivalent to\nstandard MCTS, and could be first-choice tree search algorithms for\nnon-stochastic, fully-observable environments.","url_abs":"http://arxiv.org/abs/1805.09218v1","url_pdf":"http://arxiv.org/pdf/1805.09218v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"monte-carlo-tree-search-for-asymmetric-trees","repo_url":"https://github.com/tmoer/mcts-t","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"monte-carlo-tree-search-for-asymmetric-trees","repo_url":"https://github.com/jeapostrophe/monaco","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"NOASSERTION"}}],"tasks":[{"task_slug":"atari-games","task_name":"Atari Games"},{"task_slug":"openai-gym","task_name":"OpenAI Gym"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"tmoer/mcts-t","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"jeapostrophe/monaco","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"7ee8f9ee8f0887579757a66e45f495813389e135eb36fc18f6778a94570a0452","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}