May 2020
Problem of the Month
Getting from A to B
By Joel Nanni
Home
Problem of the Month
For each of the four grids below, there is exactly one path from A to B that visits every white square once and only once while avoiding the black squares. Legal paths involve moves up, down, left, and right – but no diagonals are allowed.
Click here for a printer version of the puzzle
Send your solution by the end of the month to:
mathpage@gmail.com