This is a game that was invented in the year 1957 by Sir Hamilton. It is a game that fully utilizes the graph theory. The game is one of the best games that in have ever found. The review, therefore, focuses on the mathematical principles behind the game which makes it so interesting.

The objective of the game is to find the Hamilton cycle along the dodecahedron edges, and ensuring that every vertex in the set is only visited once (Pegg, 2009). In the game, the player also must make sure that the starting point is also the ending point. The motivation of Hamilton to create the game was to solve the problems of symmetries in an icosahedron.

The thing that makes the game interesting is as one tries to start at one vertex and make sure that every other vertex is visited one and return to the vertex where one began. This sometimes becomes difficult for the players to pursue; they end up visiting the vertexes twice or fails to finish in the starting point.

The problem in the game is usually in twoparts; the 1^st one is to find the paths along the solid edges that enables you every vertex in the solid. And the 2^nd part is using graph theory strategies to make sure that you go up to the end of the game which is also the starting point (Barnett, 2009). The paths in the game are called Hamilton circuits, and they were named after the inventor of the game, William Hamilton. The game is very amazing to play on computers. One has to be keen to ensure that he wins the game.

References

Pegg Jr, E. (2009). The icosian game, revisited. The Mathematica Journal, 11(3), 310-314.

Barnett, J. (2009). Early writings on graph theory: Hamiltonian circuits and the Icosian game. Resources for Teaching Discrete Mathematics: Classroom Projects, History Modules, and Articles, 217-223.

Do you need high quality Custom Essay Writing Services?