{"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/single-agent-policy-tree-search-with","title":"Single-Agent Policy Tree Search With Guarantees","arxiv_id":"1811.10928","date":"2018-11-27","proceeding":"NeurIPS 2018 12","authors":["Laurent Orseau","Levi H. S. Lelis","Tor Lattimore","Théophane Weber"],"abstract":"We introduce two novel tree search algorithms that use a policy to guide\nsearch. The first algorithm is a best-first enumeration that uses a cost\nfunction that allows us to prove an upper bound on the number of nodes to be\nexpanded before reaching a goal state. We show that this best-first algorithm\nis particularly well suited for `needle-in-a-haystack' problems. The second\nalgorithm is based on sampling and we prove an upper bound on the expected\nnumber of nodes it expands before reaching a set of goal states. We show that\nthis algorithm is better suited for problems where many paths lead to a goal.\nWe validate these tree search algorithms on 1,000 computer-generated levels of\nSokoban, where the policy used to guide the search comes from a neural network\ntrained using A3C. Our results show that the policy tree search algorithms we\nintroduce are competitive with a state-of-the-art domain-independent planner\nthat uses heuristic search.","url_abs":"http://arxiv.org/abs/1811.10928v2","url_pdf":"http://arxiv.org/pdf/1811.10928v2.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":"single-agent-policy-tree-search-with","repo_url":"https://github.com/deepmind/boxoban-levels","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"heuristic-search","task_name":"Heuristic Search"},{"task_slug":"sokoban","task_name":"Sokoban"}],"methods":[{"method_slug":"a3c","method_name":"A3C"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"dense-connections","method_name":"Dense Connections"},{"method_slug":"entropy-regularization","method_name":"Entropy Regularization"},{"method_slug":"softmax","method_name":"Softmax"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.10928","atlas_url":"https://app.syntology.ai/?focus=1811.10928","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":"1811.10928"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.10928\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.10928"},"call":"get_concepts_for_paper(arxiv_id=\"1811.10928\")"}],"by_repo":[{"repo":"deepmind/boxoban-levels","kind":"official","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":"e2880d725f798fc8ab398c48dc16ea731376194b6cb022b2e5147a4df8df5822","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}