Problem

Source:

Tags: combinatorics



Sebastian, the traveling ant, walks on top of some square boards. He just walks horizontally or vertically through the squares of the boards and does not pass through the same square twice. On a board of $7\times 7$, in which squares can Sebastian start his journey so that he can pass through all the squares on the board?