{"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/biasing-mcts-with-features-for-general-games","title":"Biasing MCTS with Features for General Games","arxiv_id":"1903.08942","date":"2019-03-21","proceeding":null,"authors":["Dennis J. N. J. Soemers","Éric Piette","Cameron Browne"],"abstract":"This paper proposes using a linear function approximator, rather than a deep\nneural network (DNN), to bias a Monte Carlo tree search (MCTS) player for\ngeneral games. This is unlikely to match the potential raw playing strength of\nDNNs, but has advantages in terms of generality, interpretability and resources\n(time and hardware) required for training. Features describing local patterns\nare used as inputs. The features are formulated in such a way that they are\neasily interpretable and applicable to a wide range of general games, and might\nencode simple local strategies. We gradually create new features during the\nsame self-play training process used to learn feature weights. We evaluate the\nplaying strength of an MCTS player biased by learnt features against a standard\nupper confidence bounds for trees (UCT) player in multiple different board\ngames, and demonstrate significantly improved playing strength in the majority\nof them after a small number of self-play training games.","url_abs":"http://arxiv.org/abs/1903.08942v1","url_pdf":"http://arxiv.org/pdf/1903.08942v1.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":"biasing-mcts-with-features-for-general-games","repo_url":"https://github.com/Ludeme/LudiiAI","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"board-games","task_name":"Board Games"}],"methods":[{"method_slug":"interpretability","method_name":"Interpretability"}],"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":"Ludeme/LudiiAI","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":"55dac6a761ed3f1c608959fb7c7e52ede03d17476437b8f5336985dccd79ddcf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}