Proof WritingHardProblem-Solving Strategies
Problem-Solving Strategies · Hard problem
A walker visits every cell of a board exactly once, starting at a corner and moving each time to an edge-neighbouring cell. How many cells could be the LAST cell of the walk?