This domain is inspired by the Ravensburger Labyrinth board game. The goal is to guide a robot through a dynamically changing labyrinth. The labyrinth consists of N times N cards forming a square board and each card consists of four roads that may or may not be blocked by a wall. The robot can move freely between adjecent cards as long as it does not cross a wall. The labyrinth can be changed by pushing a row or column of cards so that the card pushed out of the board is put back at the other side of the board. In the process, the cards retain their orientation. In this way, it is possible to change the layout of the labyrinth so that the robot can move through it to find its way out. The robot always starts in the top left corner, and is allowed to leave the labyrinth once it reaches the bottom right corner and there is no wall downwards. The row or column of cards can be pushed only if the robot is not occupying any card in that row or column.
Example of a labyrinth (in its initial state):
and a possible solution:
This domain was submitted to International Planning Competition 2023 by
- Rebecca Eifler eifler@cs.uni-saarland.de, and
- Daniel Fišer danfis@danfis.cz
The PDDL domain file and the problem generator has been dedicated to the public domain by the authors.