I thought I promote my idea of making the traveling Salesman Problem into a game. Its simple. You connect all the dots so that you end up where you started. The least amount of traveled distance wins. I tested this game using my tablet and an app for TSP solving. I timed and calculated the distance of my solution and the apps computer algorithm. The result were close. I made the 50 point journey in 3205.7 pixel distance and the computer algorithm after 10 000 generation managed to do it in 3426.2 pixels distance. The pixel distance were calculated using the image software GIMP. My time was a bit longer 3 min and 50 sec vs 1 min and 50 seconds for the computer.
The problem is solved by dividing the points into rough groups. The groups don’t have to be 100% accurate at the start. Your allowed to cross boundaries so that you can solve the problem. Making the lines surrounding the groups just helps you visually.