Abstract
We present the first nature-inspired algorithm for the NP-complete Nurikabe pencil puzzle. Our method, based on Ant Colony Optimization (ACO), offers competitive performance with a direct logic-based solver, with improved run-time performance on smaller instances, but poorer performance on large instances. Importantly, our algorithm is “problem agnostic", and requires no heuristic information. This suggests the possibility of a generic ACO-based framework for the efficient solution of a wide range of similar logic puzzles and games. We further suggest that Nurikabe may provide a challenging benchmark for nature-inspired optimization.
Original language | English |
---|---|
Title of host publication | GECCO 2019 Companion - Proceedings of the 2019 Genetic and Evolutionary Computation Conference Companion |
Subtitle of host publication | July 13–17, 2019, Prague, Czech Republic |
Place of Publication | New York, NY, USA |
Publisher | ACM |
Pages | 129-130 |
Number of pages | 2 |
ISBN (Electronic) | 9781450361118, 9781450367486 |
DOIs | |
Publication status | Published - 13 Jul 2019 |
Event | The Genetic and Evolutionary Computation Conference 2019 - Prague Conference Center, Prague, Czech Republic Duration: 13 Jul 2019 → 17 Jul 2019 https://gecco-2019.sigevo.org/index.html/HomePage |
Conference
Conference | The Genetic and Evolutionary Computation Conference 2019 |
---|---|
Abbreviated title | GECCO'19 |
Country/Territory | Czech Republic |
City | Prague |
Period | 13/07/19 → 17/07/19 |
Internet address |
Keywords
- Puzzle game
- NP-complete
- Combinatorial optimization
- Ant colony optimization