Place 9 non-zero digits into the squares of a 3x3 chessboard so that any 2 consecutive digits share a common side of 2 neighboring squares.
In how many ways can this task be achieved?
There seems to be 40 distinct routes inclusive of 35 reflections and rotations.