Not Quite 5 puzzle (simple idea)
(Eingestellt am 21. Mai 2020, 18:00 Uhr von Carrick22)
Apply classic latin square rules : Each row and column must contain the digits 1-6 once.
In this puzzle, three different types of clues appears and work as follows :
- A red cell must contain a number that is not quite 5 (i.e. 4 or 6).
- The digits on the left are to be placed not quite where the 5 should be (i.e. next to the 5 in that row).
- The numbers on the top refer to the sum of the digits not quite where the 5 should be (i.e. the sum of all orthogonally adjacent squares from the 5 placed in that column).
This is an idea I came up for a sudoku, however the process of making it seems quite hard. This puzzle is for sharing the idea to everyone.
You can use Penpa-edit for solving it on your browser.
Lösungscode: Row 2, then row 3.
Kommentare
am 24. November 2020, 20:24 Uhr von Semax
Quite not bad. :)
am 2. Juni 2020, 09:32 Uhr von CHalb
Funny combination of rules. I especially like the concept of the numbers of the top.
am 23. Mai 2020, 14:15 Uhr von sf2l
sorry I do not understand the 3rd rule can anybody give an example
- If you have a 16 clue, you can fulfill it with 3/6 over and under the 5, and a 3/4 to its left and right (3+6+3+4 = 16). Digits can be repeated in the sum if they do not see each other.
am 22. Mai 2020, 05:34 Uhr von cdwg2000
The red constraint does not seem to be needed.
am 21. Mai 2020, 18:27 Uhr von glum_hippo
Seems like an interesting set of 'hybrid' constraints. Nothing I haven't seen before, but the combination does look intriguing.
