Rounds: 3
Breaks rule 1: Draw a connected path with no branching or looping (save for doubles, explained first in rule 6) through the board (which will have no repeating numbers across any row or column). Some numbers on the board may be drawn as ?s, which are a specific number unknown to the solver.
Breaks rule 1: Draw a connected path with no branching or looping (save for doubles, explained first in rule 6) through the board (which will have no repeating numbers across any row or column). Some numbers on the board may be drawn as ?s, which are a specific number unknown to the solver.
Breaks rule 1: Draw a connected path with no branching or looping (save for doubles, explained first in rule 6) through the board (which will have no repeating numbers across any row or column). Some numbers on the board may be drawn as ?s, which are a specific number unknown to the solver.
Breaks rule 2: The path consists of rounds, each of which starts on 1, goes through consecutive numbers, and ends on an instance of the number equal to the size of the board (n, if the board is n-by-n). The number of rounds is provided alongside the puzzle. The end of one round connects to the start of the next.
Breaks rule 3: Numbers cannot be landed on more than once.
Breaks rule 5: A single is any one orthogonal step from the starting cell.
Breaks rule 6: A double consists of instead going to each of the two cells (in either order) which are 1) diagonally adjacent to the starting cell, and 2) orthogonally adjacent to some particular orthogonal neighbor of the starting cell, and then going to the ending cell, which is the cell that--along with the other 3 involved in the process) is orthogonally adjacent to that aforementioned particular orthogonal neighbor.
Breaks rule 7: The last step of a double may be skipped only if the puzzle's path ends on the second step; no other step may ever be skipped.
Breaks rule 8: A double is drawn as a diamond with 4 line segments (or 2, from the starting cell, if the last step is skipped), each diagonal, connecting each of the 4 cells in the double (starting, two intermediate, ending) to its 2 diagonal neighbors.
Solved! :D