Logic Masters Deutschland e.V.

Four-Color Haisu Yajilominous

(Published on 27. September 2026, 17:54 by Nell Gwyn)

  • (Directional) Yajilin: Shade some cells dark gray such that no two shaded cells share an edge, and no cell with any clue is shaded. A (gray) digit in a cell with an arrow gives the number of shaded cells in the arrow's direction (some shaded cells may not be pointed to by any arrows).
    • Draw a single, orthogonal, non-branching path from the S to the G that passes through every cell in the grid that is neither shaded gray nor contains an arrow clue.
  • (Four-Color) Pentominous: Divide all unshaded cells in the grid (*including* the arrow clues, and all other clued cells) into pentominoes (orthogonally-connected five-cell regions).
    • Each pentomino must be one of four colors: Red, Green, Blue or Yellow.
    • No two pentominoes of the same shape (including rotations and reflections) or the same color (or both) can share an edge.
  • Haisu: A digit N (in a cell without an arrow) means, when the path visits that cell, it must do so on its Nth visit to the pentomino that contains that cell. In other words, if the clue is a 2, then the path must visit it on its second time entering that pentomino.
  • A "?" is a Haisu clue whose value depends on the color of the pentomino that contains it: Red = 1, Blue = 2, Green = 3, Yellow = 4.
  • (to clarify: The path may enter each pentomino any number of times in total, so long as any given Haisu clues within that pentomino are reached on the indicated visit)* Some clues are given as inequalities, ">" and "<" mean "greater than" and "less than" respectively.
Penpa

Solution code: The colors of each cell in column 12, from top to bottom, with 0 = gray (shaded), 1 = red, 2 = blue, 3 = green, 4 = yellow.


Solved by Jooshy, The Book Wyrm, aqjhs, NEWS, Kpn, Las4one
Full list

Comments

on 27. September 2026, 18:00 by Jooshy
Amazing puzzle, thanks for sharing!

Difficulty:5
Rating:N/A
Solved:6 times
Observed:1 times
ID:000V6H

Puzzle combination Puzzle variant Online solving tool

Enter solution

Solution code:

Login