# Winning Snake: Design Choices in Multi-Shot ASP

arXiv: https://arxiv.org/abs/2408.08150 · HTML: https://mlsanity.com/paper/2408.08150/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 3 of its 30 references that are in the map.
- First posted on arXiv 15 Aug 2024.

## Builds on (most cited first, 3 of 3)

- [Multi-shot ASP solving with clingo](https://mlsanity.com/paper/1705.09811/) (2017)
- [ASP-Core-2 Input Language Format](https://mlsanity.com/paper/1911.04326/) (2019)
- [Encoding Selection for Solving Hamiltonian Cycle Problems with ASP](https://mlsanity.com/paper/1909.08252/) (2019)

## Abstract (arXiv)

Answer set programming is a well-understood and established problem-solving and knowledge representation paradigm. It has become more prominent amongst a wider audience due to its multiple applications in science and industry. The constant development of advanced programming and modeling techniques extends the toolset for developers and users regularly. This paper demonstrates different techniques to reuse logic program parts (multi-shot) by solving the arcade game snake. This game is particularly interesting because a victory can be assured by solving the underlying NP-hard problem of Hamiltonian Cycles. We will demonstrate five hands-on implementations in clingo and compare their performance in an empirical evaluation. In addition, our implementation utilizes clingraph to generate a simple yet informative image representation of the game's progress.