{"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/better-computer-go-player-with-neural-network","title":"Better Computer Go Player with Neural Network and Long-term Prediction","arxiv_id":"1511.06410","date":"2015-11-19","proceeding":null,"authors":["Yuandong Tian","Yan Zhu"],"abstract":"Competing with top human players in the ancient game of Go has been a\nlong-term goal of artificial intelligence. Go's high branching factor makes\ntraditional search techniques ineffective, even on leading-edge hardware, and\nGo's evaluation function could change drastically with one stone change. Recent\nworks [Maddison et al. (2015); Clark & Storkey (2015)] show that search is not\nstrictly necessary for machine Go players. A pure pattern-matching approach,\nbased on a Deep Convolutional Neural Network (DCNN) that predicts the next\nmove, can perform as well as Monte Carlo Tree Search (MCTS)-based open source\nGo engines such as Pachi [Baudis & Gailly (2012)] if its search budget is\nlimited. We extend this idea in our bot named darkforest, which relies on a\nDCNN designed for long-term predictions. Darkforest substantially improves the\nwin rate for pattern-matching approaches against MCTS-based approaches, even\nwith looser search budgets. Against human players, the newest versions,\ndarkfores2, achieve a stable 3d level on KGS Go Server as a ranked bot, a\nsubstantial improvement upon the estimated 4k-5k ranks for DCNN reported in\nClark & Storkey (2015) based on games against other machine players. Adding\nMCTS to darkfores2 creates a much stronger player named darkfmcts3: with 5000\nrollouts, it beats Pachi with 10k rollouts in all 250 games; with 75k rollouts\nit achieves a stable 5d level in KGS server, on par with state-of-the-art Go\nAIs (e.g., Zen, DolBaram, CrazyStone) except for AlphaGo [Silver et al.\n(2016)]; with 110k rollouts, it won the 3rd place in January KGS Go Tournament.","url_abs":"http://arxiv.org/abs/1511.06410v3","url_pdf":"http://arxiv.org/pdf/1511.06410v3.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":"better-computer-go-player-with-neural-network","repo_url":"https://github.com/facebookresearch/darkforestGo","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":null},{"paper_slug":"better-computer-go-player-with-neural-network","repo_url":"https://github.com/CI-labo-OPU/FML_Competition2020","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"better-computer-go-player-with-neural-network","repo_url":"https://github.com/tianhai123/darkforestGo","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"torch","reach":null}],"tasks":[{"task_slug":"4k","task_name":"4k"},{"task_slug":"game-of-go","task_name":"Game of Go"}],"methods":[{"method_slug":"dcnn","method_name":"DCNN"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1511.06410","atlas_url":"https://app.syntology.ai/?focus=1511.06410","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1511.06410"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1511.06410\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1511.06410"},"call":"get_concepts_for_paper(arxiv_id=\"1511.06410\")"}],"by_repo":[{"repo":"facebookresearch/darkforestGo","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"CI-labo-OPU/FML_Competition2020","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"tianhai123/darkforestGo","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":"56908b5a44f7e314b0dcfc4ce8763ae18fdf0b9f147bf484f345e60d433eb476","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}