Logic Masters Deutschland e.V.

• Divide the grid into two orthogonally connected regions (the Haisu region and the Pentominous region), and further divide each region into subregions. Some borders are already given (two cells in the same subregion cannot have a border between them).
• Pentominous: In this region, each subregion must be exactly five cells (called "pentominoes"), and no two pentominoes of the same shape (including rotations/reflections) share an edge (any five-cell subregions in the Haisu region are ignored for this rule). A letter clue (FILNPTUVWXYZ) in this region gives the shape of the pentomino that contains that cell.
• Haisu: In this region, draw a path from the Start ("S") to the Goal ("G") that visits every cell of this region (and no cells in the other region). The path only moves orthogonally, and cannot branch or cross itself. A subregion in the Haisu region may be visited multiple times, and a number N in a cell in this region indicates that the path visits that cell on its Nth visit to the subregion that contains that cell.
• Two Truths and a Lie: With the exception of the Haisu S and G, there are exactly three of each given clue. For each of these clue trios, exactly two of them are in the "correct" region (digits in the Haisu region, letters in the Pentominous region), and one is in the opposite region. A clue in the other region has no meaning and is simply a red herring.

Penpa

Solution code: Row 5, left to right, notated as follows: If the cell is Haisu, give the number of times the path visits that cell's Haisu subregion. If Pentominous, give the letter shape of the pentomino.

Comments