{"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/sokoban","name":"Sokoban","slug":"sokoban","description_markdown":null,"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":61,"papers_with_code":32,"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/trajectory-planning","name":"Trajectory Planning"}],"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":61,"of":61,"of_with_code":32,"tagged_in_all":61,"counts":{"archive_papers_tagged":61,"with_a_code_link":32,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":61,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"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/tree-search-vs-optimization-approaches-for","slug":"tree-search-vs-optimization-approaches-for","title":"Tree Search vs Optimization Approaches for Map Generation","date":"2019-03-27","arxiv_id":"1903.11678","repositories_listed":5,"syntology":null},{"url":"/paper/planning-behavior-in-a-recurrent-neural","slug":"planning-behavior-in-a-recurrent-neural","title":"Planning in a recurrent neural network that plays Sokoban","date":"2024-07-22","arxiv_id":"2407.15421","repositories_listed":2,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/planning-behavior-in-a-recurrent-neural#ran","syntology_url":"https://syntology.ai/paper/2407.15421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.15421"}},"official":{"repos":["alignmentresearch/learned-planner","alignmentresearch/train-learned-planner"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/levin-tree-search-with-context-models","slug":"levin-tree-search-with-context-models","title":"Levin Tree Search with Context Models","date":"2023-05-26","arxiv_id":"2305.16945","repositories_listed":2,"syntology":null},{"url":"/paper/illuminating-diverse-neural-cellular-automata","slug":"illuminating-diverse-neural-cellular-automata","title":"Illuminating Diverse Neural Cellular Automata for Level Generation","date":"2021-09-12","arxiv_id":"2109.05489","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/illuminating-diverse-neural-cellular-automata#ran","syntology_url":"https://syntology.ai/paper/2109.05489","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.05489"}},"official":{"repos":["smearle/control-pcgrl"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/inductive-general-game-playing","slug":"inductive-general-game-playing","title":"Inductive general game playing","date":"2019-06-23","arxiv_id":"1906.09627","repositories_listed":2,"syntology":null},{"url":"/paper/q-map-a-convolutional-approach-for-goal","slug":"q-map-a-convolutional-approach-for-goal","title":"Scaling All-Goals Updates in Reinforcement Learning Using Convolutional Neural Networks","date":"2018-10-06","arxiv_id":"1810.02927","repositories_listed":2,"syntology":null},{"url":"/paper/learning-to-search-with-mctsnets","slug":"learning-to-search-with-mctsnets","title":"Learning to Search with MCTSnets","date":"2018-02-13","arxiv_id":"1802.04697","repositories_listed":2,"syntology":null},{"url":"/paper/interpreting-learned-search-finding-a","slug":"interpreting-learned-search-finding-a","title":"Interpreting learned search: finding a transition model and value function in an RNN that plays Sokoban","date":"2025-06-11","arxiv_id":"2506.10138","repositories_listed":1,"syntology":null},{"url":"/paper/solving-sokoban-using-hierarchical-1","slug":"solving-sokoban-using-hierarchical-1","title":"Solving Sokoban using Hierarchical Reinforcement Learning with Landmarks","date":"2025-04-06","arxiv_id":"2504.04366","repositories_listed":1,"syntology":null},{"url":"/paper/magebench-bridging-large-multimodal-models-to","slug":"magebench-bridging-large-multimodal-models-to","title":"MageBench: Bridging Large Multimodal Models to Agents","date":"2024-12-05","arxiv_id":"2412.04531","repositories_listed":1,"syntology":null},{"url":"/paper/learning-discrete-world-models-for-heuristic","slug":"learning-discrete-world-models-for-heuristic","title":"Learning Discrete World Models for Heuristic Search","date":"2024-09-14","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/a-training-data-recipe-to-accelerate-a-search","slug":"a-training-data-recipe-to-accelerate-a-search","title":"A Training Data Recipe to Accelerate A* Search with Language Models","date":"2024-07-13","arxiv_id":"2407.09985","repositories_listed":1,"syntology":null},{"url":"/paper/3d-building-generation-in-minecraft-via-large","slug":"3d-building-generation-in-minecraft-via-large","title":"3D Building Generation in Minecraft via Large Language Models","date":"2024-06-13","arxiv_id":"2406.08751","repositories_listed":1,"syntology":null},{"url":"/paper/beyond-a-better-planning-with-transformers","slug":"beyond-a-better-planning-with-transformers","title":"Beyond A*: Better Planning with Transformers via Search Dynamics Bootstrapping","date":"2024-02-21","arxiv_id":"2402.14083","repositories_listed":1,"syntology":{"n":14,"n_ran":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":1,"n_honours":3,"n_violates":0,"n_no_contract":5,"n_pointer_only":14,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 3 honoured, 0 violated, 5 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/beyond-a-better-planning-with-transformers#ran","syntology_url":"https://syntology.ai/paper/2402.14083","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2402.14083"}},"official":{"repos":["facebookresearch/searchformer"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/on-grid-graph-reachability-and-puzzle-games","slug":"on-grid-graph-reachability-and-puzzle-games","title":"On Grid Graph Reachability and Puzzle Games","date":"2023-10-02","arxiv_id":"2310.01378","repositories_listed":1,"syntology":null},{"url":"/paper/thinker-learning-to-plan-and-act-1","slug":"thinker-learning-to-plan-and-act-1","title":"Thinker: Learning to Plan and Act","date":"2023-07-27","arxiv_id":"2307.14993","repositories_listed":1,"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":0,"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/thinker-learning-to-plan-and-act-1#ran","syntology_url":"https://syntology.ai/paper/2307.14993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.14993"}},"official":{"repos":["stephen-chung-mh/thinker"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/start-small-training-game-level-generators","slug":"start-small-training-game-level-generators","title":"Start Small: Training Controllable Game Level Generators without Training Data by Learning at Multiple Sizes","date":"2022-09-29","arxiv_id":"2209.15052","repositories_listed":1,"syntology":null},{"url":"/paper/fast-and-precise-adjusting-planning-horizon","slug":"fast-and-precise-adjusting-planning-horizon","title":"Fast and Precise: Adjusting Planning Horizon with Adaptive Subgoal Search","date":"2022-06-01","arxiv_id":"2206.00702","repositories_listed":1,"syntology":null},{"url":"/paper/expose-combining-state-based-exploration-with","slug":"expose-combining-state-based-exploration-with","title":"ExPoSe: Combining State-Based Exploration with Gradient-Based Online Search","date":"2022-02-03","arxiv_id":"2202.01461","repositories_listed":1,"syntology":null},{"url":"/paper/subgoal-search-for-complex-reasoning-tasks","slug":"subgoal-search-for-complex-reasoning-tasks","title":"Subgoal Search For Complex Reasoning Tasks","date":"2021-08-25","arxiv_id":"2108.11204","repositories_listed":1,"syntology":null},{"url":"/paper/classical-planning-in-deep-latent-space-1","slug":"classical-planning-in-deep-latent-space-1","title":"Classical Planning in Deep Latent Space","date":"2021-06-30","arxiv_id":"2107.00110","repositories_listed":1,"syntology":null},{"url":"/paper/policy-guided-heuristic-search-with","slug":"policy-guided-heuristic-search-with","title":"Policy-Guided Heuristic Search with Guarantees","date":"2021-03-21","arxiv_id":"2103.11505","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/policy-guided-heuristic-search-with#ran","syntology_url":"https://syntology.ai/paper/2103.11505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.11505"}},"official":{"repos":["levilelis/h-levin"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-action-model-learning-for-player","slug":"towards-action-model-learning-for-player","title":"Towards Action Model Learning for Player Modeling","date":"2021-03-09","arxiv_id":"2103.05682","repositories_listed":1,"syntology":null},{"url":"/paper/physically-embedded-planning-problems-new","slug":"physically-embedded-planning-problems-new","title":"Physically Embedded Planning Problems: New Challenges for Reinforcement Learning","date":"2020-09-11","arxiv_id":"2009.05524","repositories_listed":1,"syntology":null},{"url":"/paper/mixed-initiative-level-design-with-rl-brush","slug":"mixed-initiative-level-design-with-rl-brush","title":"Mixed-Initiative Level Design with RL Brush","date":"2020-08-06","arxiv_id":"2008.02778","repositories_listed":1,"syntology":null},{"url":"/paper/solving-hard-ai-planning-instances-using","slug":"solving-hard-ai-planning-instances-using","title":"Solving Hard AI Planning Instances Using Curriculum-Driven Deep Reinforcement Learning","date":"2020-06-04","arxiv_id":"2006.02689","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/solving-hard-ai-planning-instances-using#ran","syntology_url":"https://syntology.ai/paper/2006.02689","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.02689"}},"official":null}},{"url":"/paper/multi-objective-level-generator-generation","slug":"multi-objective-level-generator-generation","title":"Multi-Objective level generator generation with Marahel","date":"2020-05-17","arxiv_id":"2005.08368","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-sensitive-learning-and-planning-1","slug":"uncertainty-sensitive-learning-and-planning-1","title":"Uncertainty-sensitive Learning and Planning with Ensembles","date":"2019-12-19","arxiv_id":"1912.09996","repositories_listed":1,"syntology":null},{"url":"/paper/uncertainty-sensitive-learning-and-planning","slug":"uncertainty-sensitive-learning-and-planning","title":"Uncertainty - sensitive learning and planning with ensembles","date":"2019-09-25","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/learning-local-forward-models-on-unforgiving","slug":"learning-local-forward-models-on-unforgiving","title":"Learning Local Forward Models on Unforgiving Games","date":"2019-09-01","arxiv_id":"1909.00442","repositories_listed":1,"syntology":null},{"url":"/paper/an-investigation-of-model-free-planning","slug":"an-investigation-of-model-free-planning","title":"An investigation of model-free planning","date":"2019-01-11","arxiv_id":"1901.03559","repositories_listed":1,"syntology":null},{"url":"/paper/single-agent-policy-tree-search-with","slug":"single-agent-policy-tree-search-with","title":"Single-Agent Policy Tree Search With Guarantees","date":"2018-11-27","arxiv_id":"1811.10928","repositories_listed":1,"syntology":null},{"url":null,"slug":"interpreting-emergent-planning-in-model-free","title":"Interpreting Emergent Planning in Model-Free Reinforcement Learning","date":"2025-04-02","arxiv_id":"2504.01871","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-explainable-goal-recognition-using","title":"Towards Explainable Goal Recognition Using Weight of Evidence (WoE): A Human-Centered Approach","date":"2024-09-18","arxiv_id":"2409.11675","repositories_listed":0,"syntology":null},{"url":null,"slug":"autoverse-an-evolvable-game-langugage-for","title":"Autoverse: An Evolvable Game Language for Learning Robust Embodied Agents","date":"2024-07-05","arxiv_id":"2407.04221","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpreting-multi-objective-evolutionary","title":"Interpreting Multi-objective Evolutionary Algorithms via Sokoban Level Generation","date":"2024-06-15","arxiv_id":"2406.10663","repositories_listed":0,"syntology":null},{"url":null,"slug":"alphazeroes-direct-score-maximization","title":"AlphaZeroES: Direct score maximization outperforms planning loss minimization","date":"2024-06-12","arxiv_id":"2406.08687","repositories_listed":0,"syntology":null},{"url":null,"slug":"human-goal-recognition-as-bayesian-inference","title":"Human Goal Recognition as Bayesian Inference: Investigating the Impact of Actions, Timing, and Goal Solvability","date":"2024-02-16","arxiv_id":"2402.10510","repositories_listed":0,"syntology":null},{"url":null,"slug":"pcgpt-procedural-content-generation-via","title":"PCGPT: Procedural Content Generation via Transformers","date":"2023-10-03","arxiv_id":"2310.02405","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-in-the-imagination-high-level","title":"AI planning in the imagination: High-level planning on learned abstract search spaces","date":"2023-08-16","arxiv_id":"2308.08693","repositories_listed":0,"syntology":null},{"url":null,"slug":"explainable-goal-recognition-a-framework","title":"Explainable Goal Recognition: A Framework Based on Weight of Evidence","date":"2023-03-09","arxiv_id":"2303.05622","repositories_listed":0,"syntology":null},{"url":null,"slug":"level-generation-through-large-language","title":"Level Generation Through Large Language Models","date":"2023-02-11","arxiv_id":"2302.05817","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-differentiable-loss-function-for-learning","title":"A Differentiable Loss Function for Learning Heuristics in A*","date":"2022-09-12","arxiv_id":"2209.05206","repositories_listed":0,"syntology":null},{"url":null,"slug":"keke-ai-competition-solving-puzzle-levels-in","title":"Keke AI Competition: Solving puzzle levels in a dynamically changing mechanic space","date":"2022-09-11","arxiv_id":"2209.04911","repositories_listed":0,"syntology":null},{"url":null,"slug":"left-heavy-tails-and-the-effectiveness-of-the","title":"Left Heavy Tails and the Effectiveness of the Policy and Value Networks in DNN-based best-first search for Sokoban Planning","date":"2022-06-28","arxiv_id":"2206.14298","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-first-order-symbolic-planning-1","title":"Learning First-Order Symbolic Planning Representations That Are Grounded","date":"2022-04-25","arxiv_id":"2204.11902","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-of-destruction-learning-an-iterative","title":"Path of Destruction: Learning an Iterative Level Generator Using a Small Dataset","date":"2022-02-21","arxiv_id":"2202.10184","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-automated-curriculum-strategy-to-1","title":"A Novel Automated Curriculum Strategy to Solve Hard Sokoban Planning Instances","date":"2021-10-03","arxiv_id":"2110.00898","repositories_listed":0,"syntology":null},{"url":null,"slug":"potential-based-reward-shaping-in-sokoban","title":"Potential-based Reward Shaping in Sokoban","date":"2021-09-10","arxiv_id":"2109.05022","repositories_listed":0,"syntology":null},{"url":null,"slug":"there-is-no-turning-back-a-self-supervised","title":"There Is No Turning Back: A Self-Supervised Approach for Reversibility-Aware Reinforcement Learning","date":"2021-06-08","arxiv_id":"2106.04480","repositories_listed":0,"syntology":null},{"url":null,"slug":"transfer-learning-and-curriculum-learning-in","title":"Transfer Learning and Curriculum Learning in Sokoban","date":"2021-05-25","arxiv_id":"2105.11702","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-sokoban-with-backward-reinforcement","title":"Solving Sokoban with forward-backward reinforcement learning","date":"2021-05-05","arxiv_id":"2105.01904","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-tabula-rasa-a-modular-reinforcement","title":"Beyond Tabula-Rasa: a Modular Reinforcement Learning Approach for Physically Embedded 3D Sokoban","date":"2020-10-03","arxiv_id":"2010.01298","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-gap-providing-post-hoc-symbolic","title":"Bridging the Gap: Providing Post-Hoc Symbolic Explanations for Sequential Decision-Making Problems with Inscrutable Representations","date":"2020-02-04","arxiv_id":"2002.01080","repositories_listed":0,"syntology":null},{"url":null,"slug":"working-memory-graphs","title":"Working Memory Graphs","date":"2019-11-17","arxiv_id":"1911.07141","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-algorithmic-solutions-to-symbolic","title":"Learning Algorithmic Solutions to Symbolic Planning Tasks with a Neural Computer Architecture","date":"2019-10-30","arxiv_id":"1911.00926","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-algorithmic-solutions-to-symbolic-1","title":"Learning Algorithmic Solutions to Symbolic Planning Tasks with a Neural Computer","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"procedural-generation-of-initial-states-of","title":"Procedural Generation of Initial States of Sokoban","date":"2019-07-04","arxiv_id":"1907.02548","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-to-novel-objects-using-prior","title":"Generalization to Novel Objects using Prior Relational Knowledge","date":"2019-06-26","arxiv_id":"1906.11315","repositories_listed":0,"syntology":null},{"url":null,"slug":"zero-shot-transfer-with-deictic-object","title":"Zero-Shot Transfer with Deictic Object-Oriented Representation in Reinforcement Learning","date":"2018-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-in-game-playing-sokoban-solver","title":"AI in Game Playing: Sokoban Solver","date":"2018-06-29","arxiv_id":"1807.00049","repositories_listed":0,"syntology":null}],"syntology_records":6,"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":6,"papers_where_code_ran_first_page":"/task/sokoban/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/sokoban/papers/ran/1","json":"/task/sokoban/papers/ran/1.json","rows":6}],"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":"ff1b461e9a7603d58b47154bf5833849212b0925c5e1c5844c079339bb17e14a","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}