How many unique ways can you make a path on a 3x3 grid which passes through every square once assuming rotations and reflections are distinct? No crossing or diagonal moves are allowed.
I am not concerned with a starting or ending position. By just considering as many cases as I can by hand I think the answer may be 16, but this is not convincing at all. Any help would be great!