{"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/staralgo-a-squad-movement-planning-library","title":"StarAlgo: A Squad Movement Planning Library for StarCraft using Monte Carlo Tree Search and Negamax","arxiv_id":"1812.11371","date":"2018-12-29","proceeding":null,"authors":["Mykyta Viazovskyi","Michal Certicky"],"abstract":"Real-Time Strategy (RTS) games have recently become a popular testbed for\nartificial intelligence research. They represent a complex adversarial domain\nproviding a number of interesting AI challenges. There exists a wide variety of\nresearch-supporting software tools, libraries and frameworks for one RTS game\nin particular -- StarCraft: Brood War. These tools are designed to address\nvarious specific sub-problems, such as resource allocation or opponent\nmodelling so that researchers can focus exclusively on the tasks relevant to\nthem. We present one such tool -- a library called StarAlgo that produces plans\nfor the coordinated movement of squads (groups of combat units) within the game\nworld. StarAlgo library can solve the squad movement planning problem using one\nof two algorithms: Monte Carlo Tree Search Considering Durations (MCTSCD) and a\nslightly modified version of Negamax. We evaluate both the algorithms, compare\nthem, and demonstrate their usage. The library is implemented as a static C++\nlibrary that can be easily plugged into most StarCraft AI bots.","url_abs":"http://arxiv.org/abs/1812.11371v1","url_pdf":"http://arxiv.org/pdf/1812.11371v1.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":"staralgo-a-squad-movement-planning-library","repo_url":"https://github.com/Games-and-Simulations/StarAlgo","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"real-time-strategy-games","task_name":"Real-Time Strategy Games"},{"task_slug":"starcraft","task_name":"Starcraft"}],"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":"Games-and-Simulations/StarAlgo","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":"1e3ad1dd888b285ec7edca32424f12de498bd43cd9c6dcb9bcbe6d5d65fba29e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}