|title:||Kwirk (Puzzle Boy) editor and solver|
|keywords:||puzzle game, search methods, Binary Decision Diagram (BDD), SAT solving|
|topics:||Case studies and Applications|
|committee:||Ernst Moritz Hahn|
Kwirk (known in Japan as Puzzle Boy) (https://en.wikipedia.org/wiki/Kwirk, https://www.youtube.com/watch?v=cftX1ShGSC4, ...) is a puzzle video game similar to Sokoban. This project targets at developing a level editor for this game as well as a solver for this game. The solver could be realised by simple explicit-state exhaustive search. More advanced methods might involve encoding the game using Binary Decision Diagrams (BDDs) or as a SAT problem.
Other details: The level of difficulty of this project is variable, depending on the exact project agreement. A very good level editor would be a diligent but routine piece of work. For the solver there is a large adjustability in the difficulty. A simple exhaustive search might be not that difficult. However, a compact representation of explicit states will require some work, and BDD- and SAT-based solutions require a good understanding of these methods, of course.