Determination of an Efficient Method to Solve the Guarini Puzzle Generalization Using BipartiteGraph
1Determination of an Efficient Method to Solve the Guarini Puzzle Generalization Using Bipartite Graph
In this study there it is presented an interactive software implemented in the C# oriented object programming language using Net Framework platform that allows for the efficient solution of a puzzle obtained through the use of Guarini puzzle generalisation. This entails taking into account 6 knights placed on a 3 n dimensional chessboard. Three of the knights are white and are on the first line of the chessboard, while the other three are black and are on the last line of the chessboard. The goal of this puzzle is to move the knights in as few moves as possible such that all of the black knights are on the first line and all of the white knights are on the last line. This problem falls under a category of problems that can be solved quickly using graph theory, a field of discrete mathematics. The modelling of the interactive software is achieved through specific UML diagrams representing the stages of analysis, design and implementation, the system thus being described in a clear and practical manner. Unified Modelling Language is a highly recognized and understood platform for software design, being the perfect visual language to communicate detailed information about the architecture to the largest number of users.