Opening the paper…
Figure from the original question paper **STATE SPACE**\ Select the algorithms that find the shortest path (measured in number of hops). **STATE SPACE** N-Square-Touch game description with a figure of a sample 2x2 move from 01/01 to 00/11 via touch(2,2) and the question