The travelling salesman problem: Difference between revisions
No edit summary |
No edit summary |
||
| Line 22: | Line 22: | ||
Using only green <code>steering</code> blocks, try to visit as many cities as possible, and minimizing the travel distance or travelling time. | Using only green <code>steering</code> blocks, try to visit as many cities as possible, and minimizing the travel distance or travelling time. | ||
== Example Code == | |||
== Exercises == | == Exercises == | ||
Revision as of 22:30, 16 October 2020
Introduction
The travelling salesman problem is a legendary math problem. The question is, how to find the shortest path to visit all the given cities and to come back home. To make the game interesting, many cities are needed, and thus a rather large floor area.
Aim
Distance, time. Geography.
Robot
Almost any robot will do, though we use Asimov 2/ Verne robot.
Sensors
No sensors are used, except the servo motors.
Example Video
Theory
Write (or print) the names of cities (eg. European capitals) into papers. The Wikipedia page includes 50 countries, and that might be too much, but choose 7 to 15 cities to be distributed and taped onto the floor.
Using only green steering blocks, try to visit as many cities as possible, and minimizing the travel distance or travelling time.
Example Code
Exercises
Back to Mahtavaa Matematiikkaa 2020
