Minesweeper goes Kaboom (in ASP) - and what makes it difficult
From International Center for Computational Logic
Minesweeper goes Kaboom (in ASP) - and what makes it difficult
Thesis defence by Antonio Hentschke
- Location: APB 3027
- Start: 16. May 2024 at 11:00 am
- End: 16. May 2024 at 12:00 pm
- Research group: Knowledge-Based Systems
- Event series: Research Seminar Logic and AI
- iCal
Kaboom is a fair Minesweeper game. The original Kaboom is implemented with a SAT solver, and we present an implementation in ASP (Answer Set Programming). We will derive a recommender heuristic and demonstrate the game. At the end we will discuss what makes Minesweeper and Kaboom difficult and how they differ in that regard.
