Logic Masters Deutschland e.V.

Canyonlands (A38 + Rassi Silai)

(Published on 16. March 2025, 17:07 by sfushidahardy)

Canyonlands

Made for round two of the Pencil Puzzle Madness tournament. For those unfamiliar with A38, I recommend this introductory puzzle by tuace. I hope you enjoy the puzzle!

Rules:
  • Nomenclature: Numbers in the grid are called "number clues", black squares are "stations", the black circle is the "starting circle", and grey cells are "grey cells".
  • Every non-number and non-grey cell is visited by the traveler (A38) or a rope (Rassi Silai), but not both.
  • (Variant A38.) Draw a directed path (the traveler) which travels orthogonally through the centers of some non-number and non-grey cells, visits every station, and starts and ends at the "starting circle". There are permits whose positions must be determined in some of the (up to) eight cells neighbouring a number-clue. A clue number N indicates that the traveler obtains a permit in the Nth neighbouring cell reached along the path. A permit is required to pass through a station. Two permits cannot be held at the same time. In other words, the traveler alternates between obtaining permits and passing through stations.
  • (Variant Rassi Silai.) Draw several paths (ropes) in the grid which travel orthogonally through the centers of cells. Each endpoint of a rope must be in one of the (up to) 8 cells surrounding a number clue. Endpoints of a rope cannot be diagonally or orthogonally adjacent to other rope endpoints, or to A38 permits. Conversely, every number clue contains a rope endpoint in at least one of the (up to) 8 surrounding cells.

Other puzzles I've made for the tournament:
Round one: Anableps.
Round three: Zombie!.
Semi-final: Amoeba Festival.
Final: Janus.

The puzzle only requires you to draw paths, but I've added green and red circles to indicate rassi endpoints and A38 permits, as well as numbers to indicate the clue-neighbouring-cells visited by the traveler.

Solution code: The number of Rassi Silai rope turns in each row, top to bottom. For the example puzzle, the solution code would be 10010000.

Last changed on on 8. August 2025, 14:15

Solved by Agent, MaizeGator, dumediat, polar, KNT, tuace, widjo, filuta, Niverio, askaksaksask, CutieRainbow, ns08, Mr_tn, rmn, RJBlarmo
Full list

Comments

on 2. August 2025, 21:29 by RJBlarmo
Fantastic! Very impressive how many interesting deductions result from a puzzle with such few clues.

on 8. May 2025, 04:43 by askaksaksask
Wild, wild solve. I thought for sure i had broken this, but alas, here we are. From the (very cool) break in to some incredible directed loop steps, this puzzle was fun but also wholly original. Brilliantly done. Thank you!

on 27. April 2025, 19:48 by Niverio
Brilliant puzzle!

on 5. April 2025, 10:14 by filuta
spectacular! one of those puzzles

on 23. March 2025, 23:51 by tuace
Awesome puzzle, I enjoyed it a lot...

on 20. March 2025, 02:51 by KNT
Really interesting initial deductions followed by a smooth solve (if you read the rules properly)

on 17. March 2025, 15:24 by dumediat
Absolutely wild and fascinating puzzle, and a lot of fun to solve!

on 16. March 2025, 23:40 by sfushidahardy
Fixed example image. Thank you polar.

on 16. March 2025, 17:20 by MaizeGator
Absolutely insane connectivity logic! I remember thinking "no way can this possibly work", except then it somehow does.

on 16. March 2025, 17:13 by Agent
Awesome puzzle! A wonderful break-in and very cool connectivity logic, the puzzle resolves itself once you understand key implications, which was very satisfying.

Difficulty:5
Rating:100 %
Solved:15 times
Observed:3 times
ID:000M7V

Puzzle combination Path puzzle

Enter solution

Solution code:

Login