A travelling salesman is working between 7 cities. Total distances between cities were rounded to the nearest 5 kms. The optimal route was calculated to minimise distance while visiting each city only once and returning back to the start. The cities are numbered in the order visited.
Normal Sudoku rules apply.
Olive green thin lines are Mod 5 sum lines - the sum of the digits of the cells the line passes through is a muliple of 5. Digits of cells where the line is only along the cell's edge are not included in the line's sum.
Yellow circles are Doubles and Quadruples and every digit in the circle must be assigned to one of its surrounding cells inside the sudoku grid.
Cells joined by a V must sum to 5. Cells joined by an X must sum to 10. Not all Xs and Vs are given.
Cells joined by a white dot are consecutive. Cells joined by a black dot must have a ratio of 2. Not all dots are given.
Link to sudokupad
--------------------------------
Hope you enjoy it. Feel free to give feedback.
Thanks
---------------------------------
Solution code: The digits of the cells that the route from cities 6 -> 3 -> 7 -> 1 passes through (ignoring edge only digits).
on 7. December 2024, 14:13 by mimec
Very nice idea, I enjoyed solving it.
on 7. December 2024, 11:31 by lmdemasi
Fun idea and cool puzzle!
Going in I was half expecting to have to do some math on one of the lines that made sure the given path was the optimal solution to the TSP, but I'm relieved it was not required.