This puzzle was made for Isaiah's anti-pairdoku slow setting competition on the CtC discord server. Hopefully it's a little more approachable than most of my weird topology puzzles. Thanks to ChinStrap for testing! Hope you enjoy, and thanks for playing!
High Six: In each 6x6 grid, place the digits 4-9 once each in every row, column, and box.
Anti Pairdoku: No digit may occupy the same position in both grids.
Ratio Kropki: The cells separated by a black dot are in a 1:2 ratio.
German Whisper Pairrows: In a cell with green arrows the digit, N, which is placed in that cell indicates that the cells exactly N moves away in the directions the arrows point must contain digits that differ from N by 3 or more.
Renban Pairrows: In a cell with pink arrows the digit, N, which is placed in that cell indicates that the clue cell and the cells exactly N moves away in the directions the arrows point together must form a set of non-repeating consecutive digits.
Linked Torus: The two grids combine to form a torus; an arrow that points beyond the left edge of one grid will re-enter from the right side of the other grid, and an arrow that points beyond the bottom of one grid will re-enter the other grid from its top. The coloring reflects this.
For this reason it is possible for multiple arrows from a clue to point at a single cell (or even at themselves). A renban arrow considers the set of cells indicated by arrows, not the set of arrows, so if a cell is seen by multiple arrows, that does not count as a repeated digit for the renban.
Click the puzzle to play!
Lösungscode: Row 5 of the right grid (6 numbers)
am 20. Januar 2025, 00:28 Uhr von dragoond
Thank you very much for the lovely puzzle. The mobiusness was a bit confusing at first, but flowed well afterwards. Due to the initial confusion and easy possibility to slip up, I'll estimate ~2.5 difficulty.
Some comments:
Perhaps rephrasing the "Renban pairrows" may be helpful.
I may have missed something, but I didn't need the horizontal arrow in the bottom right corner of the left puzzle.
The link may not have the solution check enabled.
Schwierigkeit: | ![]() |
Bewertung: | N/A |
Gelöst: | 3 mal |
Beobachtet: | 3 mal |
ID: | 000LOM |