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

Q: 如果Graph 31 - NP hard game mix of graph theory and geography在你的國家或地區不可用，應該如何下載？

點擊<a href="https://apkpure.com/howto/how-to-download-an-iphone-app-if-it-is-not-available-in-your-country">此處</a>瞭解如何在受限國家或地區下載Graph 31 - NP hard game mix of graph theory and geography。

$0.99

1.0for iPhone, iPad

Artem Tselikov

Developer

2016年07月29日

Update Date

Education

Category

Age Rating

Apps in this category do not contain restricted content.

Apps in this category may contain mild or occasional cartoon, fantasy or real-life violence, as well as occasional or mild adult, sexually suggestive or horrifying content and may not be suitable for children under 9 years of age.

12+

Apps in this category may contain occasional mild indecent language, frequent or intense cartoon or real-life violence, minor or occasional adult or sexually suggestive material, and simulated gambling, and may be for children under 12 years of age.

17+

You must be at least 17 years old to access this App.

Apps in this category may contain frequent and intense offensive language; Frequent and intense cartoon, fantasy or realistic violence: frequent and intense adult, scary and sexually suggestive subjects: as well as sexual content, nudity, tobacco, alcohol and drugs, may not be suitable for children under 17 years of age.

Graph 31 - NP hard game mix of graph theory and geography 螢幕截圖

iPad

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

iPhone

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