Travelling Santa Problem

Add to favoritesRemove from favorites

Advertisement

Mouse
If the game freezes, just click inside it (games can get unresponsive if you click elsewhere on the page).
Total:
  • 2,439,968 plays
  • 28 active players online

Advertisement

Advertisement

The Travelling Santa Problem (TSP) is an NP-hard problem in combinatorial optimization studied in operations research and theoretical computer science. Given a list of cities and their pairwise distances, the task is to find a shortest possible tour that visits each city exactly once. Santa has a big problem with outlining his christmas route. To not overwork his reindeers, he would like to choose the shortest one. He will be travelling from town to town through all countries of the world. You have to point out the optimal, that is the shortest, route for the Santa's Sleigh. Help Santa Claus!

We recommend the top of funny, exciting and cool free online games. Try them all.