In the Network Game, you can help us find out how humans approach solving some of the most difficult computational problems. However, wait a minute! What does it mean for something to be difficult? Most of us would probably find the multiplication 1337*42 quite impossible (it’s 56154), but it can easily be performed by a computer. Some problems cannot be easily performed even by a computer—such as making a non-conflicting schedule for university courses. These problems are known as NP-hard problems. In these problems, finding good enough solutions often requires creative leaps, which computers are terrible at doing; unlike humans. In the Network Game, you must help us solving such NP-hard problems and see if you can find the necessary creative leaps.
In this game, you must find the shapes which find the network the best. The network is defined by cyan and white connections. White connections give points when they connect shapes of the same type and the opposite way goes for cyan connections. However, for large networks, you cannot satisfy all connections! Dammit! So you must find the best trade-off between all the connections. This trade-off is what makes the problem very difficult.
This game is currently an early demo of a gameplay we might pursue further in the future.