In the game of chess, a knight in row R and column C may move to row 1 R Band column 1 C
Chapter 10, Problem 10.60(choose chapter or problem)
In the game of chess, a knight in row R and column C may move to row 1 R Band column 1 C B (where B is the size of the board) provided that either|R R| = 2 and |C C| = 1or|R R| = 1 and |C C| = 2A knights tour is a sequence of moves that visits all squares exactly once beforereturning to the starting point.a. If B is odd, show that a knights tour cannot exist.b. Give a backtracking algorithm to find a knights tour.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer