Commit a730610b authored by Johannes Bleher's avatar Johannes Bleher
Browse files

README added

parent 39ae579b

01_code/231211_JB_data_generation.R

+1 −1
Original line number Diff line number Diff line
@@ -22,7 +22,7 @@ out$y <- ncol(raster)-(ncol(raster)-out$y+1) 
out$x <- nrow(raster)-out$x+1



out.idx1 <- which(out$z %in% c("#000000","#333333"))

smpl.idx1 <- sample(out.idx1,size=60000,replace=FALSE)

smpl.idx1 <- sample(out.idx1,size=70000,replace=FALSE)

out.idx2 <- which(out$z %in% c("#666666"

                               ,"#999999"))

smpl.idx2 <- sample(out.idx2,size=30000,replace=FALSE)

README.md

0 → 100644
+29 −0
Original line number Diff line number Diff line 
<table>

  <tr>

    <!-- Image Column -->

    <td>

      <img src="00_data/RJ_santa.jpeg" alt="Image Description"/>

    </td>



    <!-- Text Column -->

    <td>

    

    # Traveling Santa Problem

    

    ## Overview

    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`).

    - 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`.

    

    ## Good Luck!

    Ensure your solution adheres to the constraints and optimizes the travel path. Happy coding!

   </td>

  </tr>

</table>   
 No newline at end of file