Logic Masters Deutschland e.V.

Hesperia (Beachcomber)

(Published on 21. February 2024, 16:17 by dumediat)

This is a puzzle that I made for the February 2024 monthly puzzle prompt (puzzle using a single constraint) in the CTC Discord server. This uses the Beachcomber constraint pioneered by glum_hippo, and was inspired by their puzzles Arvada and Biloxi (which I highly recommend).

Ratings, comments, and feedback are much appreciated! Please feel free to reach out to me on Discord if you have any comments or questions. Please also feel free to try my other puzzles here.

Rules:

  • Normal sudoku rules apply. Place the digits 1 to 9 in the grid such that digits do not repeat in any row, column, or 3x3 box.
  • Beachcomber: The digit X inside a circle indicates that a total of X digits less than X can be seen in its row and column. Digits larger than X block the view. There is no negative constraint (ie, not all circles are necessarily shown).

Penpa+: http://tinyurl.com/29otnzub

SudokuPad: https://sudokupad.app/6rvvk8rz6u

Solution code: Row 6 (9 digits)


Solved by glum_hippo, heliopolix , Myxo, tuturitu, halakani, Azumagao, Bellsita, lmdemasi, StefanSch, onbu, Piatato, AvonD, marcmees, agueybana, cegie, farodin64, teuthida, Doofenschmirtz, SKORP17, madhupt, OGRussHood, Paletron, goodcity, PippoForte
Full list

Comments

on 19. March 2024, 13:24 by OGRussHood
It's astounding that only ten circles were necessary to provide a valid unique solution. What a design.

on 23. February 2024, 01:06 by marcmees
Very Nice. Thanks

on 22. February 2024, 20:44 by Piatato
Cool puzzle!

on 21. February 2024, 16:29 by Myxo
Very nice puzzle with a solution path that was unexpected for me. I am glad the old sacrilegious name has been changed.

Last changed on 22. February 2024, 11:48

on 21. February 2024, 16:25 by glum_hippo
This was delightful, and a clear refutation of my assumption that the 'beachcomber' rule set was thin on potential new logic.

Difficulty:4
Rating:95 %
Solved:24 times
Observed:6 times
ID:000H1J

Puzzle variant Online solving tool

Enter solution

Solution code:

Login