You can navigate the grid below from the top-left yellow circle to the bottom-right yellow square by making only orthogonal (not diagonal) moves, going from one position to the next only if the shape and/or the color of the shape in the entered cell is the same as that of the cell you are leaving.

• What path has the minimum number of moves without going through the same cell twice?
• What path has the maximum number of moves without going through the same cell twice?

(In reply to education by September Dillon)

Just wanna remark on few general things, The website style is ideal, the topic matter is rattling good.

Posted by doraamma on 2021-04-11 16:18:58