MathDB

The traveler ant is walking over several chess boards. He only walks vertically and horizontally through the squares of the boards and does not pass two or more times over the same square of a board. a) In a

4

4

board, from which squares can he begin his travel so that he can pass through all the squares of the board? b) In a

5

5

board, from which squares can he begin his travel so that he can pass through all the squares of the board? c) In a

n

n

board, from which squares can he begin his travel so that he can pass through all the squares of the board?

Problem Statement