# Another follow the path of relation through the grid

Inspired by Galen's series of puzzles...there is a relation between rectilinear-adjacent squares such that there is a unique rectilinear path from the top-left corner of the grid down to the bottom-right corner of the grid. Each square can participate in the path no more than once. What is the relation and the path it induces?

Path(Sorry, but I did on my IPad:

Relation:

Difference adjacent numbers is a power of 2

• Perfectly correct! May 19 '20 at 5:32

Absolute differences between successive terms are all squares.

• yes, this is a path but the relation does not satisfy all of the conditions of the question. May 19 '20 at 1:06
• This path is unique under the given relation; what condition is being violated? May 19 '20 at 2:41
• I think you need to check that again. The path is not unique under the given relation. May 19 '20 at 2:50
• Agh, you're right. There's two paths, and rot13(obgu pbagnva ercrngf fb V'z abg fher juvpu bar vf gur pbeerpg bar, vs rvgure vf.) May 19 '20 at 3:06
• Neither can be correct, since the relation does not produce a unique path. Don't feel bad though, I did my best to bait exactly this trap :-) May 19 '20 at 5:26