This is a cooperation project with HTBLA Leonding (Technical College Leonding) that deals with chessboard tilings. Concretely, we are given
- a 2n x 2n chessboard with one arbitrary field blocked and
- sufficiently many L-shaped stones.
The question is whether it is possible to cover the whole board using the available L-stones. The answer is yes and there is an algorithm that can compute the covering recursively. All this is known. The goal of the project is now to construct a small robot that can solve this puzzle game and that can then physically arrange the stones on a board accordingly.
This is a project in the frame of the JKU LIT Creative Artefacts Call 2019.