The „Travelling Salesman Problem“ transferred into a balance beam at the IST Austria playground to teach science in a playful way. The traveling salesman has to visit a defined number of cities. In order to save time and travel costs he needs to consider which route between the cities is the shortest. The more cities he has to visit, the more difficult it will be to find the solution.
The children can follow the „smart track“ of the ants on the bars. An instruction plate tells them what an „ant algorithm“ is and why it is related to computer science. Wooden bars, metal fittings, screws. W x D x H in MM: 4200 x 3500 x 500