From ce67a453003c3ec1be8fbe74018af71acb076652 Mon Sep 17 00:00:00 2001 From: Johannes Bleher Date: Mon, 11 Dec 2023 13:01:59 +0100 Subject: [PATCH] Description added --- README.md | 14 ++++++-------- 1 file changed, 6 insertions(+), 8 deletions(-) diff --git a/README.md b/README.md index ce0ca59..3f54c53 100644 --- a/README.md +++ b/README.md @@ -9,30 +9,28 @@ - In this challenge, you are provided with a list of cities and their coordinates in `cities.csv`. Your task is to create the shortest possible path that visits all the cities. - - + In this challenge, you are provided with a list of cities and their coordinates in `cities.csv`. Your task is to create the shortest possible path that visits all the cities. + ## Submission File 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 (`CityId = 0`). +- Paths must start and end at the North Pole (`ID = 0`). - 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 `CityId`. +- 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, subject to the constraint that every 10th step is 10% more lengthy unless coming from a prime CityId. +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 -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 (CityId = 0) and you must visit every city exactly once. Submission files must have a header and should look like: +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: Path -0 1 2 ... -- GitLab