Problem # 3 At a student's engineering convention the robotics challenge was provided by professor JB to build a smart algorithm for a car that can travel through to 12 rooms using the "knight's tour". The problem of finding the knight's tour around a chessboard is a sequence of moves made by a knight chess piece that visits each square on the board exactly once. In each move, the knight moves 2 squares horizontally then one vertically, or 2 squares vertically then 1 horizontally. (in a chess game, its move cannot be blocked by another piece). The eight squares that a knight may reach in a single move from a particular square S are Marked K in the figure below. An example of a 5x5 board would look as such. Problem # 3 At a student's engineering convention the robotics challenge was provided by professor JB to build a smart algorithm for a car that can travel through to 12 rooms using the "knight's tour". The problem of finding the knight's tour around a chessboard is a sequence of moves made by a knight chess piece that visits each square on the board exactly once. In each move, the knight moves 2 squares horizontally then one vertically, or 2 squares vertically then 1 horizontally. (in a chess game, its move cannot be blocked by another piece). The eight squares that a knight may reach in a single move from a particular square S are Marked K in the figure below. An example of a 5x5 board would look as such