@@ -54,7 +54,9 @@ He completed his worldwide festive quest!
## The challenge
In this challenge, you are provided with a list of cities and their coordinates in `00_data/point_cloud.csv`. Your task is to create the shortest possible path that visits all the cities.
## Submission File
## Submission and Submssion File
Please send your submission (code and solution file) to [aidaho@uni-hohenheim.de](mailto:aidaho@uni-hohenheim.de) or send us the link to your AIDAHO-Gitlab repo.
Your submission CSV-file contains the ordered Path that Santa should use to visit all the cities. It should be an ordered list of citie, representing the path in which you visit each city. Paths must start and end at the North Pole (ID = 1) and you must visit every city exactly once. Submission files must have a header and should look like:
<code>
Path
@@ -77,7 +79,7 @@ Your submission is scored on the Euclidean distance of your submitted path.
The submission with the shortest path will receive an AIDAHO t-shirt!
## Deadline
January 10, 2023 - Final submission deadline.
January 10, 2024 - Final submission deadline.
## Good Luck!
Ensure your solution adheres to the constraints and optimizes the travel path. Happy coding!
