{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/video-game-level-repair-via-mixed-integer","title":"Video Game Level Repair via Mixed Integer Linear Programming","arxiv_id":"2010.06627","date":"2020-10-13","proceeding":null,"authors":["Hejia Zhang","Matthew C. Fontaine","Amy K. Hoover","Julian Togelius","Bistra Dilkina","Stefanos Nikolaidis"],"abstract":"Recent advancements in procedural content generation via machine learning enable the generation of video-game levels that are aesthetically similar to human-authored examples. However, the generated levels are often unplayable without additional editing. We propose a generate-then-repair framework for automatic generation of playable levels adhering to specific styles. The framework constructs levels using a generative adversarial network (GAN) trained with human-authored examples and repairs them using a mixed-integer linear program (MIP) with playability constraints. A key component of the framework is computing minimum cost edits between the GAN generated level and the solution of the MIP solver, which we cast as a minimum cost network flow problem. Results show that the proposed framework generates a diverse range of playable levels, that capture the spatial relationships between objects exhibited in the human-authored levels.","url_abs":"https://arxiv.org/abs/2010.06627v1","url_pdf":"https://arxiv.org/pdf/2010.06627v1.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":"video-game-level-repair-via-mixed-integer","repo_url":"https://github.com/icaros-usc/milp_constrained_gan","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":null,"task_name":"Generative Adversarial Network"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2010.06627","atlas_url":"https://app.syntology.ai/?focus=2010.06627","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.06627"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-25T09:33:49+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/icaros-usc/milp_constrained_gan","reach":null}],"summary":{"ran_fixture":2,"ran_honours":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"samples":[{"code_sha256_prefix":"33d201b3658d5fb8","entry":"combine_images","repo":"icaros-usc/milp_constrained_gan","repo_kind":"official","path":"launchers/pacman_gan_training.py","file_url":"https://github.com/icaros-usc/milp_constrained_gan/blob/HEAD/launchers/pacman_gan_training.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"33d201b3658d5fb8"}},{"code_sha256_prefix":"d57bdaf4b1832379","entry":"gan_output_to_txt","repo":"icaros-usc/milp_constrained_gan","repo_kind":"official","path":"launchers/zelda_gan_partial_lp_end2end_generate.py","file_url":"https://github.com/icaros-usc/milp_constrained_gan/blob/HEAD/launchers/zelda_gan_partial_lp_end2end_generate.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d57bdaf4b1832379"}},{"code_sha256_prefix":"234cbd04e431c0d8","entry":"txt_to_gan_output","repo":"icaros-usc/milp_constrained_gan","repo_kind":"official","path":"launchers/zelda_gan_partial_lp_end2end_generate.py","file_url":"https://github.com/icaros-usc/milp_constrained_gan/blob/HEAD/launchers/zelda_gan_partial_lp_end2end_generate.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"234cbd04e431c0d8"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}