Logic Masters Deutschland e.V.

Renban whispers ‘Niemals vier’

(Published on 5. August 2024, 18:14 by Jrosas)

RULES:

Ordinary renban, German whispers, and “never 4” rules apply.

EXPLANATION OF RULES:

renban: digits on a purple line are a set of consecutive numbers

German whispers: adjacent digits on a green line differ by at least 5

”never 4”: place the digits 0 to 9 (never 4) in every row, column, and 3x3 box

0 and 1 are consecutive. 0 and 9 are not.

Sven Neumann’s Sudokupad

Solution code: Column 2

Last changed on on 13. August 2024, 11:08

Solved by Onyx, sujoyku, Sinuit, SKORP17, LehanLehan, hige, bbutrosghali, _KitKat_, PuzzlePatzer, Megalobrainiac, JayBird, sfield, ArnulfKoch, karen_birgitta, zrbakhtiar, fstilus, THef of Time
Full list

Comments

on 17. August 2024, 02:24 by Jrosas
The reason it says “Niemals vier” and not “never four” is that Renban’s whisper is a German whisper.

on 13. August 2024, 18:47 by Jrosas
Puzzle Patzer’s solve video:
https://youtu.be/SN54wQeub5M?si=JMXfBIFj9uraO-Gb

on 13. August 2024, 11:08 by Jrosas
Link with solution

Last changed on 6. August 2024, 22:56

on 6. August 2024, 16:44 by PuzzlePatzer
The combination of Never 4 and German Whispers make for a very enjoyable puzzle! Thanks for sharing.

Sometimes I forget and put a 4 in my own puzzles.

Last changed on 6. August 2024, 00:28

on 5. August 2024, 19:07 by sujoyku
Thank you for this nice puzzle, Jrosas! The "0-9 without 4" ruleset is a fun twist on the usual polarity deductions. For me, it was 2 stars difficulty. But I completely understand your point. Thank you for setting and sharing this entertaining challenge!

Thank you. Please take a minute and mouseclick to rate the puzzle.

**
Already done. I usually rate puzzles before I am leaving a comment. I have rated it 2 stars for difficulty, 5 stars for beauty. Thank you. I can’t see it on the English page. BTW I am working on Cada oveja con su pareja.

**
Ah cool. That is one of my hardest puzzle. If you like a hint, feel free to ask.

Difficulty:2
Rating:89 %
Solved:17 times
Observed:1 times
ID:000J81

Enter solution

Solution code:

Login