{"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/text-based-adventures-of-the-golovin-ai-agent","title":"Text-based Adventures of the Golovin AI Agent","arxiv_id":"1705.05637","date":"2017-05-16","proceeding":null,"authors":["Bartosz Kostka","Jaroslaw Kwiecien","Jakub Kowalski","Pawel Rychlikowski"],"abstract":"The domain of text-based adventure games has been recently established as a\nnew challenge of creating the agent that is both able to understand natural\nlanguage, and acts intelligently in text-described environments.\n  In this paper, we present our approach to tackle the problem. Our agent,\nnamed Golovin, takes advantage of the limited game domain. We use genre-related\ncorpora (including fantasy books and decompiled games) to create language\nmodels suitable to this domain. Moreover, we embed mechanisms that allow us to\nspecify, and separately handle, important tasks as fighting opponents, managing\ninventory, and navigating on the game map.\n  We validated usefulness of these mechanisms, measuring agent's performance on\nthe set of 50 interactive fiction games. Finally, we show that our agent plays\non a level comparable to the winner of the last year Text-Based Adventure AI\nCompetition.","url_abs":"http://arxiv.org/abs/1705.05637v1","url_pdf":"http://arxiv.org/pdf/1705.05637v1.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":"text-based-adventures-of-the-golovin-ai-agent","repo_url":"https://github.com/BYU-PCCL/z-machine-games","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"text-based-adventures-of-the-golovin-ai-agent","repo_url":"https://github.com/asannasi/txt_adv_nlp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"ai-agent","task_name":"AI Agent"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1705.05637","atlas_url":"https://app.syntology.ai/?focus=1705.05637","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":"1705.05637"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1705.05637\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1705.05637"},"call":"get_concepts_for_paper(arxiv_id=\"1705.05637\")"}],"by_repo":[{"repo":"BYU-PCCL/z-machine-games","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"asannasi/txt_adv_nlp","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1806.11532"],"harvested_for_calls":[{"arxiv_id":"1806.11532","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1806.11532"},"call":"get_harvested_code_for_paper(arxiv_id=\"1806.11532\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"63e7acfd2e81d9d96a0714df0d6d99441a2d17ce444629239706311bd43ab006","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}