Logic Masters Deutschland e.V.

Connon #2

(Published on 7. August 2021, 13:49 by PrimeWeasel)



Normal Sudoku rules apply

Some cells have been marked with a circle or square; the digit in each such cell indicates the number of consecutive (square) or non-consecutve (circle) digits which are orthogonally and diagonally adjacent to that specific cell.
All possible squares and circles have been given.

f-puzzle

The slightly harder first Connon can be found here: Connon

Solution code: Column 8, row 8


Solved by marcmees, parkinson, henrypijames, SirWoezel, filuta, PulverizingPancake, Sktx, karen_birgitta, bigger, Qodec, ParaNox, Rollo, zlotnleo, Richard, Statistica, KlausRG, sandmoppe, Mody, pin7guin, Piatato, Uhu, Vebby, apwelho, LadyShapeShifter, nottabird
Full list

Comments

on 6. April 2022, 22:26 by Piatato
Cool ruleset! Should definitely have checked this one out before. :D

on 17. February 2022, 19:45 by pin7guin
Knifflig - und wunderschön, wenn man sich in diese Variante reingedacht hat.

Last changed on 17. November 2021, 08:21

on 16. November 2021, 18:32 by Richard
Exciting untill the last digits!
Thanks for this gem and his big brother. :-)

~ My pleasure! Thanks for adding a new member to the family!

Last changed on 24. September 2021, 18:41

on 24. September 2021, 13:49 by Rollo
Auch toll :-).

Danke schön!

on 8. August 2021, 15:57 by Sktx
A very nice retake on your ruleset ! A very stable level of difficulty throughout the solve, with really nice logic along the way. And a very good use of the negative constraint, too. Thanks !

Last changed on 8. August 2021, 13:44

on 8. August 2021, 02:27 by filuta
nice puzzle, thanks.

Thanks for solving!

Last changed on 7. August 2021, 22:50

on 7. August 2021, 22:41 by henrypijames
This one would've been a much better introduction to the ruleset.

~ Yeah, I know, I just hadn't been expecting the first one to get such few solves, I remember the times when solvers were a bit more intrigued by new logic and persevered a bit more. So, I reckoned these rules needed yet again an easier version. Anyway, thanks for solving henry.

Last changed on 7. August 2021, 22:45

on 7. August 2021, 17:08 by marcmees
NIce. Will certainly have a look at No 1. thanks.

~ Thanks for solving marc! (And the first one)

Difficulty:3
Rating:92 %
Solved:25 times
Observed:9 times
ID:00077Y

Puzzle variant Online solving tool

Enter solution

Solution code:

Login