The ‘Knight’s Tour’ Problem

The Knight tour is a mathematical problem where through a sequence of moves according to the rules of chess, a knight placed on any square, moves across the board visiting each square exactly once. The swiss mathematician, Leonhard Euler is credited with coming up with the first suitable solutions to this problem in the late … Continue reading →