@@ -60,17 +63,15 @@ In this challenge, you are provided with a list of cities and their coordinates
Your submission should be an ordered list of cities, representing the path in which you visit each city.
## Path Constraints
- Paths must start and end at the North Pole (`ID = 0`).
- Paths must start and end at the North Pole (`ID = 1`).
- You must visit every city exactly once.
- The distance between two cities is calculated as the 2D Euclidean distance.
- Every 10th step (`stepNumber % 10 == 0`) is 10% longer, except when the step is coming from a city with a prime `ID`.
## Evaluation
Your submission is scored on the Euclidean distance of your submitted path.
Your submission is scored on the Euclidean distance of your submitted path, subject to the constraint that every 10th step is 10% more lengthy unless coming from a prime ID.
Submission file
##Submission file
Your submission file contains the ordered Path that Santa should use to visit all the cities. 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
@@ -83,5 +84,8 @@ Path
## Prizes
The first prize is a AIDAHO t-shirt!
## Deadline
January 10, 2023 - Final submission deadline.
## Good Luck!
Ensure your solution adheres to the constraints and optimizes the travel path. Happy coding!
