Graph 31 - NP hard game mix of graph theory and geography

One of the millennium Nobel prize problems is the famous P versus NP problem. If you were able to prove or disprove that P = NP, you would get 1 million dollars.

But this is way too hard for a regular mind.

We have something easier for you.

Graph31 is a game which is based on Graph Theory.

This logical game would taking you all around the globe.

Each level is a famous geographical location, cities on the map and roads between them are tangled in such a way that they represent some of the famous Graph Theory problems, such as shortest path problem, traveling salesman problem and clique problem.

If you were to design an algorithm to solve the puzzles of this game, you would not be able to come up with anything that would work in the polynomial time, which makes this game NP-hard.

The greatest minds in computer science work on solving problems such as these.

Why would you not give it a try?

Graph 31 improves your ability to solve difficult problems quickly, trains your memory and logical thinking.
This game is good for all ages.