DijkstraGame

This game is based on the ability to find a minimum path to connect two nodes in a Graph. The player can choose four levels: Easy, Moderate, Hard and Customized representing graphs from the simplest to the most complex.

By choosing the customized level the player builds a custom Graph choosing the number of nodes and a connection factor.

The game starts, in all three levels, building its Graph automatically, instead for the customized level the player has to place the nodes in a proper position in order to see all paths well.

Then the player has to push the button Start Game and the time starts, the goal of the game is to find the minimum path connecting the start node to the end node, in a time as short as possible. If the player fails to find out the right path, he/she can see the right answer by pressing the button "See solution".

The right solution is calculated by the Dijkstra algorithm, to know more about this important algorithm see:

http://en.wikipedia.org/wiki/Dijkstra\'s_algorithm

The player has to complete five trials, the final score, in seconds, is the result of his/her intellectual performance.

Each time the player furnishes a wrong answer his/her time will be penalized of a factor of 200% multiplied by the factor WrongCost/CorrectCost.

However the penalized time will be never under 20 sec. so as to discourage conduct of play at random without intellectual effort.

For each level there is a top five list, the player can include his/her record in that list only if his/her performance is under the fifth result of the list.

However it is possible reset all list to start again with new records.