Logic Masters Deutschland e.V.

Light-up the World

(Eingestellt am 22. November 2022, 06:15 Uhr von KevinTheMH)

This is my second puzzle and possibly a hard one, hope you like it :D

Rules:

1. Normal sudoku rules apply.

2. Akari rules apply: place some light bulbs on the grid such that the whole grid can be illuminated. A light bulb can illuminate the row and the column where it is located, until being blocked by a wall (black cells). Two light bulbs can never see each other. One light bulb (r3c1) is given.

3. Some wall cells have digits indicating the number of bulb cells it is orthogonally connected to. They can be any digit between 1 to 9 but eventually would take the modulo from the number of its orthogonally connected cells.

e.g. if r2c1 = 4, then the number of light bulbs surrounding it would be 4 mod 3 = 1; if r3c5 = 6, then the number of light bulbs surrounding it would be 6 mod 4 = 2; if r1c4 has clue 6, then the number of light bulbs it is orthogonally connected to would be either 3 or 0.

4. There is a ray connecting some cells diagonally or orthogonally in the grid without a loop or a cross. The ray contains a segment from the given bulb directly to row 1, row 9 or column 9, and has to exit the grid after its final turn. The ray must pass through all the light bulbs

5. The ray can only make a turn after going through a bulb or a wall cell (referred to as a mirror). The digit in a mirror cell determines the direction of the ray after passing it:

1↖ 2↑ 3↗

4← 5· 6→

7↙ 8↓ 9↘

(Note that 5 cannot appear on the ray)

6. Every wall cell on the ray or is orthogonally connected to a cell on the ray must have the surrounding light bulb number clue described in rule #3.

Enjoy!

Here is an example 5x5 grid that satisfies all the rules above

Lösungscode: Row 8 and column 2

Zuletzt geändert am 12. Dezember 2022, 05:17 Uhr

Kommentare

am 12. Dezember 2022, 05:17 Uhr von KevinTheMH
Revised the rule

am 25. November 2022, 07:44 Uhr von KevinTheMH
Fixed an error in the new example grid

am 24. November 2022, 06:05 Uhr von KevinTheMH
Typo fixed

am 24. November 2022, 06:03 Uhr von KevinTheMH
Updated the description

am 24. November 2022, 06:00 Uhr von KevinTheMH
Updated the description

am 24. November 2022, 04:58 Uhr von KevinTheMH
fixed the solution code error

am 24. November 2022, 00:55 Uhr von KevinTheMH
fixed a typo

am 23. November 2022, 03:42 Uhr von KevinTheMH
Revised the rules + tags

am 23. November 2022, 03:33 Uhr von KevinTheMH
Revised the rule

Zuletzt geändert am 22. November 2022, 11:12 Uhr

am 22. November 2022, 10:59 Uhr von kjholt
Edit: I was mistaken and realized I misunderstood the modulo rule. Sorry about that! This is hard but very good so far!

am 22. November 2022, 06:29 Uhr von KevinTheMH
Added a new example grid

am 22. November 2022, 06:19 Uhr von KevinTheMH
Added an example image

Schwierigkeit:5
Bewertung:N/A
Gelöst:0 mal
Beobachtet:7 mal
ID:000C3C

Variantenkombination Neu Online-Solving-Tool Wegerätsel

Lösung abgeben

Lösungscode:

Anmelden