Binary Sudoku
(Eingestellt am 24. April 2020, 07:19 Uhr von stephane.bura)
|
General Rules: Place a digit from 1 to 9 into each cell of the grid so that every row, column and outlined 3x3 region contains each digit exactly once. 16 Unique Binary Cages: Each of the 16 4-cell cages is a unique arrangement of odd and even digits corresponding to the numbers from 0 to 15 in binary. If a digit is even, it represents a 0 bit; if it’s odd, a 1 bit. Binary Sums: Each number on the left of the grid is the sum of the two numbers (from 0 to 15) represented by the cages in this row. Cage ordering: An arrow between two cages point toward the smaller of the two when comparing their binary values. Sums within the Cages: In each of the cages corresponding to the numbers from 1 to 15, it is possible to choose one to four digits that add up to the value of the cage in binary. For instance, on the right are three valid contents for the 9 cage. 10s: If and only if two neighboring digits add up to 10, a black dot separates them. |
|
Lösungscode: Column 3, followed by column 7.
Kommentare
am 25. April 2020, 18:26 Uhr von Mesmer
It was fun to solve, but the rules are indeed complicated. A great part of its difficulty is to keeping track of these rules, and coming back to them when you solved a part of the puzzle. Another thing is that I didn't use at all the vertical "greater/less than" so they only were confusing. But, as I said, I enjoyed solving it step by step till the end.
am 25. April 2020, 16:01 Uhr von bob
A bit complicated, and requires meticulous record keeping. Fully logical for me and satisfying nonetheless.
am 25. April 2020, 00:33 Uhr von Nylimb
0100100100100000011001000110100101100100001110110010000001110100011010000110000101101110011010110111001100101110
