Problem #2

1. What is the minimum number of moves so that, beginning in one corner of an 8 x 8 chessboard, a knight can reach any square on the board in that number of moves or fewer?

2. Generalize to an n x n board.