Project of 2016

Patrick Gelß, Stefan Rüdrich, and Burkhard Schmidt

In a project presented at the "Long Night of Sciences" (LNdW) in June 2016, we illustrate the concept of finding shortest ways on (unweighted) graphs and its relation to solving word graphs (chains of words where only one letter can be changed between successive words). The project involves self-built LEGO Mindstorms robots which can freely explore our two-dimensional mazes, aiming at finding shortest paths by means of the Dijkstra algorithm which becomes intuitively apparent.