HAISU is a grid-deduction puzzle designed by this site's very own TheGreatEscaper. To quote them:
HAISU is a portmanteau of three Japanese words - 'hairu', to enter, 'su', number, and 'hausu', an English borrow word meaning house, of course. Together, we get a meaning of 'enter number house', which I have roughly translated to English as 'Room Count'.
The rules are simple - draw a path from the O to the X, passing through every cell in the grid exactly once. The grid is divided into several rooms. When your path passes over a cell with the big number N, it must be the Nth time you have entered the room. If a room has a small number m in the top left corner, you must enter that room a total of m times.
For an example puzzle, see the original post: HAISU (Room Count): An original grid-logic challenge
This puzzle is a bit different, however: it is embedded on a Möbius strip. The top and bottom act like normal, but the left and right edges join up as shown by the letters. Good luck!
Notes:
- The letters aren't their own cells, they just tell you where to join the two sides up.
- The rooms do not connect between the two sides of the puzzle (e.g. if an edge passes through d it will leave and enter the room again).
- "No guessing, no handwavy steps, just pure logic required to solve this puzzle!" - TheGreatEscaper
- Thanks Wen1now for testsolving!
N
), you have to pass over the cell theN
th time you enter the room that contains your cell. $\endgroup$