May 2020
Problem of the Month

Getting from A to B
By Joel Nanni
in GAMES April 2020

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

Solution to the Problem:

Correctly solved by:

1. Ivy Joseph	Pune, Maharashtra, India
2. Kendall Carr	Mountain View High School, Mountain View, Wyoming
3. Katelynn Hope	Mountain View High School, Mountain View, Wyoming
4. Aidan Salinas	Mountain View High School, Mountain View, Wyoming

Send any comments or questions to: David Pleacher