Project of 2015

Lange Nacht der Wissenschaften

Patrick Gelß, Stefan Rüdrich, Marjan Mirahmadi, Stefan Klus, and Burkhard Schmidt

In a project presented at the "Long Night of Sciences" (LNdW) in June 2015, we illustrate the concept of finding shortest ways on (unweighted) graphs and its relations to various applications. The project involves self-built LEGO Mindstorms robots which can freely explore our two-dimensional mazes, aiming at finding a hidden target and the shortest possible way to get to it. The pro's and con's of different maze solving algorithms (such as "always left", "depth first", and simple "Monte Carlo") become intuitively apparent.

Poster.pdf
Carousel imageCarousel imageCarousel imageCarousel imageCarousel imageCarousel imageCarousel image