The Knight's Tour problem (or the problem of the knight or Euler's knight) is a mathematical-logical problem based on the movements of the knight of the chess board. A knight positioned on any square of a chessboard must be able to move to every square without passing on the same square two times. The objective is to move through all the squares of the chessboard once with the knight, starting from a point and respecting the usual rules of movement of the knight in chess games. Can the knight of the chessboard be moved to all squares without passing over the same one twice?