Hardest, Guarini's Problem - 6 Knights Puzzle in a 4x3 Chess Board Grid | Hardest Puzzle скачать в хорошем качестве

Hardest, Guarini's Problem - 6 Knights Puzzle in a 4x3 Chess Board Grid | Hardest Puzzle

Guarini's Problem - 6 Knights Puzzle in a 4x3 Chess Board Grid | Hardest Puzzle Guarini's problem is one of the earliest chessboard puzzles that dates back to 1512. This puzzle involves four knights, two white and two black, at the four corners of a small 3x3 chessboard. The problem is to exchange the places of the white knights and the black knights. If you have solved this problem, you should have observed its underlying basic structure. This simple structure comes from two things: The geometry of the board How knights are allowed to move Guarini's problem illustrates the way in which mathematical abstraction can clear the messy details of a problem. This general process of turning a problem in to a graph is so useful and so natural that an entire area of mathematics , called graph theory has evolved to study only the properties of such graphs. So the solution is a simple cyclic graph. We will have to complete 2 cycles in any direct Clockwise or anticlockwise . . . . . . . Do like and support my channel!!!!!!!!!!!!!!