Logic Masters Deutschland e.V.

Sashigane Building Walk

(Published on 3. May 2025, 02:19 by yttrio)

This puzzle is my fourth round entry for the pencil puzzle hybrid competition held on the Skunkworks Discord server.

Rules:
Building Walk: Draw a non-intersecting path through the centers of some cells, starting from the S (start), traveling through every number and shaded cell (elevator) in the grid, and finishing at the G (goal). The path has a floor number, which changes as it visits shaded cells (elevators). When it travels over an elevator with an up triangle, this number can increase by any amount (at least 1). When it travels over an elevator with a down triangle, it can decrease by any amount (at least 1). When it travels over a shaded cell (elevator) without a triangle, the number can increase or decrease by any amount, but cannot remain the same. The floor number cannot go below 1 or above the highest number in the grid. A number may only be visited when the path is on the corresponding floor.

Sashigane: Divide the grid into regions of orthogonally connected cells. Each region must be an L shape with a width of one cell. Arrows must lie at one end of an L and point toward the bend. Circles must lie at the bend of an L.

Except for elevator cells, every sashigane region belongs to only one building walk floor. In other words, every non-elevator cell within any given sashigane region must have the same building walk floor number. Elevator cells may belong to any sashigane region (as they are effectively part of every floor).




Penpa+

Solution code: The floor number of each cell in row 8 (left to right), with hyphens between digits where there are sashigane borders (e.g., 11-222-2-333-1)


Solved by Agent, dumediat, sfushidahardy, sorryimLate, Mr_tn, Jesper, Niverio, Calesch, widjo, TheZwierz, Paletron, ns08, jkuo7, tuace, Zzzyxas
Full list

Comments

on 3. May 2025, 15:50 by Niverio
Beautiful connectivity logic :D

on 3. May 2025, 09:31 by sorryimLate
Superb!

on 3. May 2025, 06:34 by sfushidahardy
Great puzzle!

on 3. May 2025, 03:00 by dumediat
I thoroughly enjoyed this one, thank you!

on 3. May 2025, 02:29 by Agent
Very smooth with some nice connectivity logic!

Difficulty:3
Rating:98 %
Solved:15 times
Observed:1 times
ID:000N6M

Variant combination Path puzzle

Enter solution

Solution code:

Login