{"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":"/task/game-of-go","name":"Game of Go","slug":"game-of-go","description_markdown":"Go is an abstract strategy board game for two players, in which the aim is to surround more territory than the opponent. The task is to train an agent to play the game and be superior to other players.","categories":[{"name":"Playing Games","url":"/area/playing-games"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":62,"papers_with_code":20,"benchmarks":1,"benchmark_tables_in_archive":1,"benchmark_tables_shown":1,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/game-of-go-on-elo-ratings","slug":"game-of-go-on-elo-ratings","dataset":"ELO Ratings","dataset_url":null,"rows_in_archive":1,"metrics":["ELO Rating"],"first_row_in_archive_order":{"model":"AlphaGo Zero","paper_title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm","paper_url":"/paper/mastering-chess-and-shogi-by-self-play-with-a","paper_date":"2017-12-05","arxiv_id":"1712.01815","code_links":[{"title":"ray-project/ray","url":"https://github.com/ray-project/ray/tree/master/rllib"},{"title":"gcp/leela-zero","url":"https://github.com/gcp/leela-zero"},{"title":"leela-zero/leela-zero","url":"https://github.com/leela-zero/leela-zero"},{"title":"suragnair/alpha-zero-general","url":"https://github.com/suragnair/alpha-zero-general"},{"title":"tensorflow/minigo","url":"https://github.com/tensorflow/minigo"},{"title":"Zeta36/chess-alpha-zero","url":"https://github.com/Zeta36/chess-alpha-zero"},{"title":"opendilab/LightZero","url":"https://github.com/opendilab/LightZero"},{"title":"jonathan-laurent/AlphaZero.jl","url":"https://github.com/jonathan-laurent/AlphaZero.jl"},{"title":"glinscott/leela-chess","url":"https://github.com/glinscott/leela-chess"},{"title":"leelachesszero/lczero","url":"https://github.com/leelachesszero/lczero"},{"title":"QueensGambit/CrazyAra","url":"https://github.com/QueensGambit/CrazyAra"},{"title":"michaelnny/alpha_zero","url":"https://github.com/michaelnny/alpha_zero"},{"title":"sai-dev/sai","url":"https://github.com/sai-dev/sai"},{"title":"plkmo/AlphaZero_Connect4","url":"https://github.com/plkmo/AlphaZero_Connect4"},{"title":"foersterrobert/AlphaZero","url":"https://github.com/foersterrobert/AlphaZero"},{"title":"Nkluge-correa/teeny-tiny_castle","url":"https://github.com/Nkluge-correa/teeny-tiny_castle"},{"title":"AIRLegend/ChessRL","url":"https://github.com/AIRLegend/ChessRL"},{"title":"saikrishna-1996/deep_pepper_chess","url":"https://github.com/saikrishna-1996/deep_pepper_chess"},{"title":"pathway/alphaxos","url":"https://github.com/pathway/alphaxos"},{"title":"QueensGambit/CrazyAra-Engine","url":"https://github.com/QueensGambit/CrazyAra-Engine"},{"title":"MerceaOtniel/HybridAlpha","url":"https://github.com/MerceaOtniel/HybridAlpha"},{"title":"Sidus-smg/ataxx-ai","url":"https://github.com/Sidus-smg/ataxx-ai"},{"title":"k-lombard/Deep-Learning-Chess-AI","url":"https://github.com/k-lombard/Deep-Learning-Chess-AI"},{"title":"k-lombard/CS4641_Project","url":"https://github.com/k-lombard/CS4641_Project"},{"title":"BertilBraun/ChessBot","url":"https://github.com/BertilBraun/ChessBot"},{"title":"John-Yu/leelaApplication","url":"https://github.com/John-Yu/leelaApplication"},{"title":"jasonrobwebster/alphazero-clone","url":"https://github.com/jasonrobwebster/alphazero-clone"},{"title":"aduerig/burrus","url":"https://github.com/aduerig/burrus"},{"title":"jonah-chen/alphazero-guerzhoy","url":"https://github.com/jonah-chen/alphazero-guerzhoy"},{"title":"ryanp73/ChessAI","url":"https://github.com/ryanp73/ChessAI"},{"title":"fantianwen/laalaz13E","url":"https://github.com/fantianwen/laalaz13E"},{"title":"ComarPers922/AI-based-3D-Game-Simulator","url":"https://github.com/ComarPers922/AI-based-3D-Game-Simulator"},{"title":"colindbrown/columbia-deep-learning-project","url":"https://github.com/colindbrown/columbia-deep-learning-project"},{"title":"souvikshanku/HexapawnZero","url":"https://github.com/souvikshanku/HexapawnZero"},{"title":"amjshl/compute_efficient_alphazero","url":"https://github.com/amjshl/compute_efficient_alphazero"},{"title":"wcarvalho/jaxneurorl","url":"https://github.com/wcarvalho/jaxneurorl"},{"title":"amaarquadri/PerfectInformationGame","url":"https://github.com/amaarquadri/PerfectInformationGame"},{"title":"helpstonex/crazyara","url":"https://github.com/helpstonex/crazyara"},{"title":"svikramank/chess-deepRL","url":"https://github.com/svikramank/chess-deepRL"},{"title":"wangml999/chess_zero","url":"https://github.com/wangml999/chess_zero"},{"title":"samiamkhan/4641Project","url":"https://github.com/samiamkhan/4641Project"},{"title":"amaar-quadri/PerfectInformationGame","url":"https://github.com/amaar-quadri/PerfectInformationGame"},{"title":"Neo-The1/ThinkingTicTacToe","url":"https://github.com/Neo-The1/ThinkingTicTacToe"},{"title":"cjohnchen/mirror","url":"https://github.com/cjohnchen/mirror"},{"title":"zhoujianxing123/minigo_v17","url":"https://github.com/zhoujianxing123/minigo_v17"},{"title":"mengyangbai/CchessGo","url":"https://github.com/mengyangbai/CchessGo"},{"title":"qinwang/leela-zero","url":"https://github.com/qinwang/leela-zero"},{"title":"gtagency/beta-zero","url":"https://github.com/gtagency/beta-zero"},{"title":"alreadydone/Leela_Phoenix","url":"https://github.com/alreadydone/Leela_Phoenix"},{"title":"MingzhenY/Projects","url":"https://github.com/MingzhenY/Projects"},{"title":"l1t1/lz19","url":"https://github.com/l1t1/lz19"},{"title":"jonahs99/baby-zero","url":"https://github.com/jonahs99/baby-zero"},{"title":"cosmobobak/ttt-ml","url":"https://github.com/cosmobobak/ttt-ml"},{"title":"fantianwen/leela13_training","url":"https://github.com/fantianwen/leela13_training"},{"title":"sagpant/leela-zero","url":"https://github.com/sagpant/leela-zero"},{"title":"intenseG/BSK","url":"https://github.com/intenseG/BSK"},{"title":"simoll/apo","url":"https://github.com/simoll/apo"},{"title":"langorou/vamperouge","url":"https://github.com/langorou/vamperouge"},{"title":"samhippie/q-game-agent","url":"https://github.com/samhippie/q-game-agent"},{"title":"cjohnchen/changebale","url":"https://github.com/cjohnchen/changebale"},{"title":"goodls-cs/leela-zero","url":"https://github.com/goodls-cs/leela-zero"},{"title":"cjohnchen/sai","url":"https://github.com/cjohnchen/sai"}],"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":4,"n_instrument":9,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 9 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mastering-chess-and-shogi-by-self-play-with-a#ran","syntology_url":"https://syntology.ai/paper/1712.01815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.01815"}},"official":null}}}],"datasets":[{"url":"/dataset/page","name":"PAGE","full_name":"Professional go annotation dataset","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/board-games","name":"Board Games"}],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":62,"of":62,"of_with_code":20,"tagged_in_all":62,"counts":{"archive_papers_tagged":62,"with_a_code_link":20,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":62,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/mastering-chess-and-shogi-by-self-play-with-a","slug":"mastering-chess-and-shogi-by-self-play-with-a","title":"Mastering Chess and Shogi by Self-Play with a General Reinforcement Learning Algorithm","date":"2017-12-05","arxiv_id":"1712.01815","repositories_listed":62,"syntology":{"n":17,"n_ran":13,"n_constructed":0,"n_ran_checked":4,"n_instrument":9,"n_unverified":4,"n_honours":3,"n_violates":1,"n_no_contract":0,"n_pointer_only":9,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 3 honoured, 1 violated, 0 with no contract checked; 9 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/mastering-chess-and-shogi-by-self-play-with-a#ran","syntology_url":"https://syntology.ai/paper/1712.01815","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1712.01815"}},"official":null}},{"url":"/paper/mastering-atari-go-chess-and-shogi-by","slug":"mastering-atari-go-chess-and-shogi-by","title":"Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model","date":"2019-11-19","arxiv_id":"1911.08265","repositories_listed":18,"syntology":{"n":64,"n_ran":43,"n_constructed":36,"n_ran_checked":43,"n_instrument":0,"n_unverified":21,"n_honours":4,"n_violates":0,"n_no_contract":39,"n_pointer_only":62,"phrase":"43 ran (of which 36 constructed an object rather than computing a result; 43 with no instrument failure: 4 honoured, 0 violated, 39 with no contract checked; 0 where Syntology's instrument failed) · 21 unverified","sample_list":"/paper/mastering-atari-go-chess-and-shogi-by#ran","syntology_url":"https://syntology.ai/paper/1911.08265","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.08265"}},"official":null}},{"url":"/paper/accelerating-self-play-learning-in-go","slug":"accelerating-self-play-learning-in-go","title":"Accelerating Self-Play Learning in Go","date":"2019-02-27","arxiv_id":"1902.10565","repositories_listed":6,"syntology":null},{"url":"/paper/better-computer-go-player-with-neural-network","slug":"better-computer-go-player-with-neural-network","title":"Better Computer Go Player with Neural Network and Long-term Prediction","date":"2015-11-19","arxiv_id":"1511.06410","repositories_listed":3,"syntology":null},{"url":"/paper/active-reinforcement-learning-for-robust","slug":"active-reinforcement-learning-for-robust","title":"Active Reinforcement Learning for Robust Building Control","date":"2023-12-16","arxiv_id":"2312.10289","repositories_listed":2,"syntology":null},{"url":"/paper/planning-in-stochastic-environments-with-a","slug":"planning-in-stochastic-environments-with-a","title":"Planning in Stochastic Environments with a Learned Model","date":"2021-09-29","arxiv_id":null,"repositories_listed":2,"syntology":null},{"url":"/paper/moet-interpretable-and-verifiable","slug":"moet-interpretable-and-verifiable","title":"MoËT: Mixture of Expert Trees and its Application to Verifiable Reinforcement Learning","date":"2019-06-16","arxiv_id":"1906.06717","repositories_listed":2,"syntology":null},{"url":"/paper/perceptual-similarity-for-measuring-decision","slug":"perceptual-similarity-for-measuring-decision","title":"Perceptual Similarity for Measuring Decision-Making Style and Policy Diversity in Games","date":"2024-08-12","arxiv_id":"2408.06051","repositories_listed":1,"syntology":null},{"url":"/paper/monte-carlo-tree-search-with-boltzmann-1","slug":"monte-carlo-tree-search-with-boltzmann-1","title":"Monte Carlo Tree Search with Boltzmann Exploration","date":"2024-04-11","arxiv_id":"2404.07732","repositories_listed":1,"syntology":null},{"url":"/paper/are-alphazero-like-agents-robust-to","slug":"are-alphazero-like-agents-robust-to","title":"Are AlphaZero-like Agents Robust to Adversarial Perturbations?","date":"2022-11-07","arxiv_id":"2211.03769","repositories_listed":1,"syntology":null},{"url":"/paper/learning-and-planning-in-complex-action","slug":"learning-and-planning-in-complex-action","title":"Learning and Planning in Complex Action Spaces","date":"2021-04-13","arxiv_id":"2104.06303","repositories_listed":1,"syntology":null},{"url":"/paper/conservative-optimistic-policy-optimization","slug":"conservative-optimistic-policy-optimization","title":"Conservative Optimistic Policy Optimization via Multiple Importance Sampling","date":"2021-03-04","arxiv_id":"2103.03307","repositories_listed":1,"syntology":null},{"url":"/paper/visualizing-muzero-models","slug":"visualizing-muzero-models","title":"Visualizing MuZero Models","date":"2021-02-25","arxiv_id":"2102.12924","repositories_listed":1,"syntology":null},{"url":"/paper/derived-metrics-for-the-game-of-go-intrinsic","slug":"derived-metrics-for-the-game-of-go-intrinsic","title":"Derived metrics for the game of Go -- intrinsic network strength assessment and cheat-detection","date":"2020-09-03","arxiv_id":"2009.01606","repositories_listed":1,"syntology":null},{"url":"/paper/the-computational-limits-of-deep-learning","slug":"the-computational-limits-of-deep-learning","title":"The Computational Limits of Deep Learning","date":"2020-07-10","arxiv_id":"2007.05558","repositories_listed":1,"syntology":null},{"url":"/paper/hyper-parameter-sweep-on-alphazero-general","slug":"hyper-parameter-sweep-on-alphazero-general","title":"Hyper-Parameter Sweep on AlphaZero General","date":"2019-03-19","arxiv_id":"1903.08129","repositories_listed":1,"syntology":null},{"url":"/paper/elf-opengo-an-analysis-and-open","slug":"elf-opengo-an-analysis-and-open","title":"ELF OpenGo: An Analysis and Open Reimplementation of AlphaZero","date":"2019-02-12","arxiv_id":"1902.04522","repositories_listed":1,"syntology":null},{"url":"/paper/fml-based-dynamic-assessment-agent-for-human","slug":"fml-based-dynamic-assessment-agent-for-human","title":"FML-based Dynamic Assessment Agent for Human-Machine Cooperative System on Game of Go","date":"2017-07-16","arxiv_id":"1707.04828","repositories_listed":1,"syntology":null},{"url":"/paper/move-evaluation-in-go-using-deep","slug":"move-evaluation-in-go-using-deep","title":"Move Evaluation in Go Using Deep Convolutional Neural Networks","date":"2014-12-20","arxiv_id":"1412.6564","repositories_listed":1,"syntology":null},{"url":"/paper/teaching-deep-convolutional-neural-networks","slug":"teaching-deep-convolutional-neural-networks","title":"Teaching Deep Convolutional Neural Networks to Play Go","date":"2014-12-10","arxiv_id":"1412.3409","repositories_listed":1,"syntology":null},{"url":null,"slug":"reinforcement-learning-in-strategy-based-and","title":"Reinforcement Learning in Strategy-Based and Atari Games: A Review of Google DeepMinds Innovations","date":"2025-02-14","arxiv_id":"2502.10303","repositories_listed":0,"syntology":null},{"url":null,"slug":"master-a-multi-agent-system-with-llm","title":"MASTER: A Multi-Agent System with LLM Specialized MCTS","date":"2025-01-24","arxiv_id":"2501.14304","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-reinforcement-learning-for-5-5","title":"Deep Reinforcement Learning for 5*5 Multiplayer Go","date":"2024-05-23","arxiv_id":"2405.14265","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-success-is-not-enough-investigating-the","title":"Task Success is not Enough: Investigating the Use of Video-Language Models as Behavior Critics for Catching Undesirable Agent Behaviors","date":"2024-02-06","arxiv_id":"2402.04210","repositories_listed":0,"syntology":null},{"url":null,"slug":"explaining-how-a-neural-network-play-the-go","title":"Explaining How a Neural Network Play the Go Game and Let People Learn","date":"2023-10-15","arxiv_id":"2310.09838","repositories_listed":0,"syntology":null},{"url":null,"slug":"vision-transformers-for-computer-go","title":"Vision Transformers for Computer Go","date":"2023-09-22","arxiv_id":"2309.12675","repositories_listed":0,"syntology":null},{"url":null,"slug":"alphazero-gomoku","title":"AlphaZero Gomoku","date":"2023-09-04","arxiv_id":"2309.01294","repositories_listed":0,"syntology":null},{"url":"/paper/the-professional-go-annotation-dataset-page","slug":"the-professional-go-annotation-dataset-page","title":"The ProfessionAl Go annotation datasEt (PAGE)","date":"2022-11-03","arxiv_id":"2211.01559","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-cost-of-passing-using-deep-learning-ais","title":"The cost of passing -- using deep learning AIs to expand our understanding of the ancient game of Go","date":"2022-08-24","arxiv_id":"2208.12643","repositories_listed":0,"syntology":null},{"url":null,"slug":"leela-zero-score-a-study-of-a-score-based","title":"Score vs. Winrate in Score-Based Games: which Reward for Reinforcement Learning?","date":"2022-01-31","arxiv_id":"2201.13176","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-state-action-features-for-general","title":"Spatial State-Action Features for General Games","date":"2022-01-17","arxiv_id":"2201.06401","repositories_listed":0,"syntology":null},{"url":null,"slug":"probabilistic-dag-search","title":"Probabilistic DAG Search","date":"2021-06-16","arxiv_id":"2106.08717","repositories_listed":0,"syntology":null},{"url":null,"slug":"batch-monte-carlo-tree-search","title":"Batch Monte Carlo Tree Search","date":"2021-04-09","arxiv_id":"2104.04278","repositories_listed":0,"syntology":null},{"url":null,"slug":"mobile-networks-for-computer-go","title":"Mobile Networks for Computer Go","date":"2020-08-23","arxiv_id":"2008.10080","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-go-transformer-natural-language-modeling","title":"The Go Transformer: Natural Language Modeling for Game Play","date":"2020-07-07","arxiv_id":"2007.03500","repositories_listed":0,"syntology":null},{"url":null,"slug":"tackling-morpion-solitaire-with-alphazero","title":"Tackling Morpion Solitaire with AlphaZero-likeRanked Reward Reinforcement Learning","date":"2020-06-14","arxiv_id":"2006.07970","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-step-greedy-policies-in-model-free-deep-1","title":"Multi-step Greedy Reinforcement Learning Algorithms","date":"2019-10-07","arxiv_id":"1910.02919","repositories_listed":0,"syntology":null},{"url":null,"slug":"moet-interpretable-and-verifiable-1","title":"MoET: Interpretable and Verifiable Reinforcement Learning via Mixture of Expert Trees","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-step-greedy-policies-in-model-free-deep","title":"Multi-step Greedy Policies in Model-Free Deep Reinforcement Learning","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"playing-go-without-game-tree-search-using","title":"Playing Go without Game Tree Search Using Convolutional Neural Networks","date":"2019-07-02","arxiv_id":"1907.04658","repositories_listed":0,"syntology":null},{"url":null,"slug":"designing-game-of-theorems","title":"Designing Game of Theorems","date":"2019-06-20","arxiv_id":"1906.08549","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-a-computer-mahjong-player-via-deep","title":"Building a Computer Mahjong Player via Deep Convolutional Neural Networks","date":"2019-06-05","arxiv_id":"1906.02146","repositories_listed":0,"syntology":null},{"url":null,"slug":"generative-adversarial-imagination-for-sample","title":"Generative Adversarial Imagination for Sample Efficient Deep Reinforcement Learning","date":"2019-04-30","arxiv_id":"1904.13255","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-gfml-based-robot-agent-for-human-and","title":"A GFML-based Robot Agent for Human and Machine Cooperative Learning on Game of Go","date":"2019-01-22","arxiv_id":"1901.07191","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparing-knowledge-based-reinforcement","title":"Comparing Knowledge-based Reinforcement Learning to Neural Networks in a Strategy Game","date":"2019-01-15","arxiv_id":"1901.04626","repositories_listed":0,"syntology":null},{"url":null,"slug":"pfml-based-semantic-bci-agent-for-game-of-go","title":"PFML-based Semantic BCI Agent for Game of Go Learning and Prediction","date":"2019-01-10","arxiv_id":"1901.02999","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-modeling-game-for-deriving-theoretical","title":"Meta-modeling game for deriving theoretical-consistent, micro-structural-based traction-separation laws via deep reinforcement learning","date":"2018-10-24","arxiv_id":"1810.10535","repositories_listed":0,"syntology":null},{"url":null,"slug":"pressure-predictions-of-turbine-blades-with","title":"Pressure Predictions of Turbine Blades with Deep Learning","date":"2018-06-12","arxiv_id":"1806.06940","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-do-we-need-to-build-explainable-ai","title":"What do we need to build explainable AI systems for the medical domain?","date":"2017-12-28","arxiv_id":"1712.09923","repositories_listed":0,"syntology":null},{"url":null,"slug":"first-spike-based-visual-categorization-using","title":"First-spike based visual categorization using reward-modulated STDP","date":"2017-05-25","arxiv_id":"1705.09132","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-popperian-falsification-of-artificial","title":"A Popperian Falsification of Artificial Intelligence -- Lighthill Defended","date":"2017-04-23","arxiv_id":"1704.08111","repositories_listed":0,"syntology":null},{"url":null,"slug":"monte-carlo-tree-search-with-sampled","title":"Monte Carlo Tree Search with Sampled Information Relaxation Dual Bounds","date":"2017-04-20","arxiv_id":"1704.05963","repositories_listed":0,"syntology":null},{"url":null,"slug":"fml-based-prediction-agent-and-its","title":"FML-based Prediction Agent and Its Application to Game of Go","date":"2017-04-16","arxiv_id":"1704.04719","repositories_listed":0,"syntology":null},{"url":null,"slug":"micro-objective-learning-accelerating-deep","title":"Micro-Objective Learning : Accelerating Deep Reinforcement Learning through the Discovery of Continuous Subgoals","date":"2017-03-11","arxiv_id":"1703.03933","repositories_listed":0,"syntology":null},{"url":null,"slug":"functions-that-emerge-through-end-to-end","title":"Functions that Emerge through End-to-End Reinforcement Learning - The Direction for Artificial General Intelligence -","date":"2017-03-07","arxiv_id":"1703.02239","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-network-guided-proof-search","title":"Deep Network Guided Proof Search","date":"2017-01-24","arxiv_id":"1701.06972","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-deep-symbolic-reinforcement-learning","title":"Towards Deep Symbolic Reinforcement Learning","date":"2016-09-18","arxiv_id":"1609.05518","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-machine-generate-traditional-chinese","title":"Can Machine Generate Traditional Chinese Poetry? A Feigenbaum Test","date":"2016-06-19","arxiv_id":"1606.05829","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-vs-computer-go-review-and-prospect","title":"Human vs. Computer Go: Review and Prospect","date":"2016-06-07","arxiv_id":"1606.02032","repositories_listed":0,"syntology":null},{"url":null,"slug":"neurohex-a-deep-q-learning-hex-agent","title":"Neurohex: A Deep Q-learning Hex Agent","date":"2016-04-24","arxiv_id":"1604.07097","repositories_listed":0,"syntology":null},{"url":null,"slug":"bandit-algorithms-for-tree-search","title":"Bandit Algorithms for Tree Search","date":"2014-08-09","arxiv_id":"1408.2028","repositories_listed":0,"syntology":null},{"url":null,"slug":"selecting-computations-theory-and","title":"Selecting Computations: Theory and Applications","date":"2014-08-09","arxiv_id":"1408.2048","repositories_listed":0,"syntology":null}],"syntology_records":2,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/task/game-of-go/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/game-of-go/papers/ran/1","json":"/task/game-of-go/papers/ran/1.json","rows":2}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"a5001c42da60c63b045662e5c2f25a727fd9f40a7b5b742715267313120397e0","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}