Determination of an Efficient Method to Solve the Guarini Puzzle Generalization Using Bipartite Graph

Science Press Release Distribution Services

Determination of an Efficient Method to Solve the Guarini Puzzle Generalization Using Bipartite Graph

July 2, 2021 Engineering 0

In this study, an interactive software implemented in the C# oriented object programming language and running on the Net Framework platform is presented, allowing for the efficient solution of a puzzle obtained through the use of Guarini puzzle generalisation. This entails considering six knights on a three-dimensional chessboard. Three of the knights are white and are on the first line of the chessboard, while the remaining three are black and are on the last line. The goal of this puzzle is to move the knights as quickly as possible so that all of the black knights are on the first line and all of the white knights are on the last. This problem falls into the category of problems that can be quickly solved using graph theory, a branch of discrete mathematics. The interactive software is modeled using specific UML diagrams that represent the stages of analysis, design, and implementation, allowing the system to be described in a clear and practical manner. The Unified Modelling Language (UML) is a well-known and well-understood platform for software design, serving as the ideal visual language for communicating detailed information about the architecture to the greatest number of users.

Author (S) Details

Anca-Elena Iordan
Department of Computer Science, Faculty of Automation and Computer Science, Technical University of Cluj-Napoca, Romania.

View Book :- https://stm.bookpi.org/NAER-V4/article/view/1887

 

Leave a Reply

Your email address will not be published. Required fields are marked *