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?
There is the details about the challenge that is sharing more information and knowledge as well. On the other hand, a
Neonatal advanced life support is giving the link so that they all can get the ideas from here.
No Subject
