yin yang john (conway)
(Eingestellt am 8. April 2025, 01:50 Uhr von aqjhs)
This puzzle is loosely inspired by the 3n+1 problem, and if there's a John associated to it it has to be Conway.
- Normal sudoku rules apply.
- Divide the grid into two orthogonally connected regions such that no 2x2 area is completely contained in a region. All cells in one region will have a value of 3n+1, where n is the digit on the cell, and all cells in the other region will have a value of n/2.
- Cells joined by a white dot have values with difference equal to the number on the white dot.
- Cells joined by a black dot have values in a 1:N ratio, where N is the number on the dot.
- Clues with question marks have a number to be determined. Different clues may have different numbers and the number has as many digits as question marks on the clue, with no leading zeros.
- Not all possible dots are given.
You can find a mini version of this puzzle here.
See also:
Lösungscode: Digits that get a 3n+1 value on column 5, top to bottom.
Zuletzt geändert am 9. Mai 2025, 02:18 Uhr
Gelöst von Sotehr, starfall, Floorball36, Franjo, Piff, FrauHoppmann, SKORP17, Elliott810, Asphodel, Al Fresco, Clara123, happyteo, bansalsaab, MonsieurTRISTE, blueberrypug, PkmnQ, lmdemasi, zonka, Smoncko, Brodie2000, jkuo7, Black_Doom, Scojo, SPring
Kommentare
am 9. Mai 2025, 02:18 Uhr von aqjhs
added link to mini versions
am 8. April 2025, 23:37 Uhr von Elliott810
Beautiful puzzle! Definitely harder than 3*. Thank you:)
am 8. April 2025, 13:32 Uhr von Franjo
Wonderful math-puzzle! Maybe it would be better to write that every clue is an integer? Thank you very much for creating and sharing. I really enjoyed solving this one.
