Problem:

We want to write a program that answers the following question:

- In a chess game, can you move two knights on an empty chessboard and hit each of the 64 squares only once?

Let us now study this problem in depth.

The knight moves in an L-shaped movement (two squares in a direction and a square in a direction perpendicular to the previous one or vice versa).In this way, from two squares placed in the middle of an empty chessboard, the two knights can perform eight different moves (numbered from 0 to 7), as illustrated below: