{"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/efficient-evolutionary-methods-for-game-agent","title":"Efficient Evolutionary Methods for Game Agent Optimisation: Model-Based is Best","arxiv_id":"1901.00723","date":"2019-01-03","proceeding":null,"authors":["Simon M. Lucas","Jialin Liu","Ivan Bravi","Raluca D. Gaina","John Woodward","Vanessa Volz","Diego Perez-Liebana"],"abstract":"This paper introduces a simple and fast variant of Planet Wars as a test-bed\nfor statistical planning based Game AI agents, and for noisy hyper-parameter\noptimisation. Planet Wars is a real-time strategy game with simple rules but\ncomplex game-play. The variant introduced in this paper is designed for speed\nto enable efficient experimentation, and also for a fixed action space to\nenable practical inter-operability with General Video Game AI agents. If we\ntreat the game as a win-loss game (which is standard), then this leads to\nchallenging noisy optimisation problems both in tuning agents to play the game,\nand in tuning game parameters. Here we focus on the problem of tuning an agent,\nand report results using the recently developed N-Tuple Bandit Evolutionary\nAlgorithm and a number of other optimisers, including Sequential Model-based\nAlgorithm Configuration (SMAC). Results indicate that the N-Tuple Bandit\nEvolutionary offers competitive performance as well as insight into the effects\nof combinations of parameter choices.","url_abs":"http://arxiv.org/abs/1901.00723v1","url_pdf":"http://arxiv.org/pdf/1901.00723v1.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":"efficient-evolutionary-methods-for-game-agent","repo_url":"https://github.com/SimonLucas/ntbea","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"smac","task_name":"SMAC"},{"task_slug":"smac-1","task_name":"SMAC+"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"SimonLucas/ntbea","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":"96d05fdb07e5e5622c829a2d819a02eaa790f4776390a8ee4b280caeb8b92100","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}