Since the world is getting more and more digitalized evermore people are needed who can develop such software. To compensate this demand of developers countries such as Sweden have changed their school curricula so that students are faced with writing algorithms and therefore programs from their first day on in school. To do so, new tools and techniques have to be developed to teach young children this topic. The tool which arose from this master thesis can be used by a teacher to communicate students how to solve a complex problem algorithmically. The addressed problem is the Traveling Salesman Problem (TSP) which aims to find the shortest tour through a number of locations where each one must be visited exactly once. The goal of this master thesis is to develop a application which allows to create solutions for TSP instances. It should be possible to do so in an intuitive manner, i.e. by drawing the tour by hand, and in an algorithmic manner which must allow to execute custom code in the application. This paper gives insight into the development of the originated TSP Explorer. It comprises the elaboration of its foundation, the concept and implementation phase. A comparison of the application running in different browsers will also be given. The paper will be concluded with suggestions of further works and a critical review to point out issues that arose during implementation.