Travelling Santa Problem

Travelling Santa Problem

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!

Sheep Gift Shop

Sheep Gift Shop

It is a new funny management game where your task is very simple: you run a gift shop, it is not a usual gift shop, it is a shop for sheep, and your job is to serve customers as quickly as you can. The sheep come and tell you which gift they want to buy, you need to drag the gift to the gift box and give it to the customer. If you make a mistake just drag the gift box to the trash can.