{"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-chess","name":"Game of Chess","slug":"game-of-chess","description_markdown":"Chess is a two-player strategy board game played on a chessboard, a checkered gameboard with 64 squares arranged in an 8×8 grid. The idea of making a machine that could beat a Grandmaster human player was a fascination in the artificial community for decades. Famously IBM's DeepBlue beat Kasparov in the 1990s. More recently more human-like approaches such as AlphaZero have appeared.","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":"derived"},"counts":{"papers_tagged":24,"papers_with_code":7,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"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":0,"subtasks":0,"parent_tasks":1},"benchmarks":[],"datasets":[],"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":24,"of":24,"of_with_code":7,"tagged_in_all":24,"counts":{"archive_papers_tagged":24,"with_a_code_link":7,"where_syntology_ran_a_sample":3,"not_listed_spam_title":0,"listed":24,"listed_where_code_ran":3,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":2,"listed_every_run_a_failure_of_syntologys_instrument":1,"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/giraffe-using-deep-reinforcement-learning-to","slug":"giraffe-using-deep-reinforcement-learning-to","title":"Giraffe: Using Deep Reinforcement Learning to Play Chess","date":"2015-09-04","arxiv_id":"1509.01549","repositories_listed":3,"syntology":null},{"url":"/paper/learning-chess-blindfolded-evaluating","slug":"learning-chess-blindfolded-evaluating","title":"Chess as a Testbed for Language Model State Tracking","date":"2021-02-26","arxiv_id":"2102.13249","repositories_listed":2,"syntology":null},{"url":"/paper/deepchess-end-to-end-deep-neural-network-for","slug":"deepchess-end-to-end-deep-neural-network-for","title":"DeepChess: End-to-End Deep Neural Network for Automatic Learning in Chess","date":"2017-11-27","arxiv_id":"1711.09667","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deepchess-end-to-end-deep-neural-network-for#ran","syntology_url":"https://syntology.ai/paper/1711.09667","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.09667"}},"official":null}},{"url":"/paper/playing-chess-with-limited-look-ahead","slug":"playing-chess-with-limited-look-ahead","title":"Playing Chess with Limited Look Ahead","date":"2020-07-04","arxiv_id":"2007.02130","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-generate-move-by-move-commentary","slug":"learning-to-generate-move-by-move-commentary","title":"Learning to Generate Move-by-Move Commentary for Chess Games from Large-Scale Social Forum Data","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":null,"slug":"r2c-mapping-room-to-chessboard-to-unlock-llm","title":"R2C: Mapping Room to Chessboard to Unlock LLM As Low-Level Action Planner","date":"2025-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-human-ai-knowledge-gap-concept","title":"Bridging the Human-AI Knowledge Gap: Concept Discovery and Transfer in AlphaZero","date":"2023-10-25","arxiv_id":"2310.16410","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversifying-ai-towards-creative-chess-with","title":"Diversifying AI: Towards Creative Chess with AlphaZero","date":"2023-08-17","arxiv_id":"2308.09175","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-value-of-chess-squares","title":"The Value of Chess Squares","date":"2023-07-08","arxiv_id":"2307.05330","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-matters-the-game-of-chess","title":"Representation Matters for Mastering Chess: Improved Feature Representation in AlphaZero Outperforms Switching to Transformers","date":"2023-04-28","arxiv_id":"2304.14918","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-and-machine-practicable-mechanisms-for","title":"Human and Machine Intelligence in n-Person Games with Partial Knowledge: Theory and Computation","date":"2023-02-27","arxiv_id":"2302.13937","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-cuckoo-search-algorithm-for-the","title":"Hybrid cuckoo search algorithm for the minimum dominating set problem","date":"2022-06-28","arxiv_id":"2208.02593","repositories_listed":0,"syntology":null},{"url":null,"slug":"acquisition-of-chess-knowledge-in-alphazero","title":"Acquisition of Chess Knowledge in AlphaZero","date":"2021-11-17","arxiv_id":"2111.09259","repositories_listed":0,"syntology":null},{"url":null,"slug":"modeling-the-mistakes-of-boundedly-rational","title":"Modeling the Mistakes of Boundedly Rational Agents Within a Bayesian Theory of Mind","date":"2021-06-24","arxiv_id":"2106.13249","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-chess-blindfolded","title":"Learning Chess Blindfolded","date":"2021-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-rationales-to-improve-human-task","title":"Leveraging Rationales to Improve Human Task Performance","date":"2020-02-11","arxiv_id":"2002.04202","repositories_listed":0,"syntology":null},{"url":null,"slug":"content-determination-for-chess-as-a-source","title":"Content Determination for Chess as a Source for Suspenseful Narratives","date":"2018-11-01","arxiv_id":null,"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":"phoenix-a-self-optimizing-chess-engine","title":"Phoenix: A Self-Optimizing Chess Engine","date":"2016-03-30","arxiv_id":"1603.09051","repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-and-modeling-durations-for-habits","title":"Extracting and modeling durations for habits and events from Twitter","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extracting-fine-grained-durations-for-verbs","title":"Extracting fine-grained durations for verbs from Twitter","date":"2012-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-twitter-verb-lexicon-for-natural","title":"A New Twitter Verb Lexicon for Natural Language Processing","date":"2012-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"syntology_records":3,"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":3,"papers_where_code_ran_first_page":"/task/game-of-chess/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-chess/papers/ran/1","json":"/task/game-of-chess/papers/ran/1.json","rows":3}],"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":"80fa101b1841a36ecaa3421a92567b44a1eea6d1ea635b37565f242538338870","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}