A knight on a chessboard can move one space horizontally
Chapter 5, Problem 55E(choose chapter or problem)
Problem 55E
A knight on a chessboard can move one space horizontally (in either direction) and two spaces vertically (in either direction) or two spaces horizontally (in either direction) and one space vertically (in either direction). Suppose that we have an infinite chessboard, made up of all squares (m, n) where m and n are nonnegative integers that denote the row number and the column number of the square, respectively. Use mathematical induction to show that a knight starting at (0, 0) can visit every square using a finite sequence of moves. [Hint: Use induction on the variable s = m + n.]
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