Cupid's Entropy
(Published on 3. January 2022, 14:07 by TheRiddler)
Normal Sudoku rules apply.
Standard Arrow: Digits along an arrow must sum to the digit in the circled cell (digits may repeat along arrows).
Entropy:The low digits (1, 2, 3), middle digits (4, 5, 6) and high digits (7, 8, 9) are defined as three different groups. In the finished grid each 2x2 box has to contain at least one digit of each group..
Any feedback and/or comments as well as your ratings are greatly appreciated :-)
Solution code: Enter the digits of row 1 and row 9 (without spaces).
Comments
on 5. February 2022, 15:41 by TheRiddler
Entropy tag added
on 21. January 2022, 21:02 by Bankey
A brilliant puzzle. Got lost several times but eventually got thru. Thanks, @TheRiddler :-)
on 18. January 2022, 06:07 by Krokant
The entropy constraint works very well with the arrows. Fun solve. :)
on 3. January 2022, 17:11 by Chelo
Very nice entropy puzzle, thank you!.. Please keep on setting!..
-- Thanks for solving and the nice comment.
on 3. January 2022, 16:21 by SimiC
Amazing entropy puzzle, the way the arrows play with each other is very smooth!
-- Thanks a lot :-)
on 3. January 2022, 15:22 by aruvi
Beautiful puzzle, very enjoyable solve experience! This entropy constraint is just too fun
-- Thank you :-)
on 3. January 2022, 14:42 by Niverio
This was my first ever solved puzzle with the Entropy constraint. Lovely idea! This puzzle felt rather 2 stars to me as I managed to solve in under 20 minutes, but was great fun regardless. Finishing off the ending deadly pattern with the constraint itself was cherry on top. Ty for this, Riddler!
-- Thanks for solving the puzzle and your feedback. I think the difficulty depends a bit on your general experience as a solver and/or your experience with the Entropy constraint. I can totally see that it might be 2/5 for some :-)
on 3. January 2022, 14:24 by Mad-Tyas
A great Entropy sudoku with a lovely break-in.
I had a lot of fun to test-solve it and I'm happy that I could provide some help in the setting process.
