Logic Masters Deutschland e.V.

Quadoppelränker

(Eingestellt Gestern, 22:39 Uhr von MathGuy_12)

This was set for Scojo's Setting Saturday prompts. This time we had to create two puzzles, one that portrayed ourselves and one to imposter someone else. This year I was chosen to be impostered by the crafty Isamook! You can find his puzzle that I was up against here! Despite is best attempt to mimic some of favorite techniques, I defended my idenity :D

Thanks to LMDemasi, NEWS, and CalvinBall for testing! And a huge thank you to everyone involved in the event, it was fantastic!

SudokuPad Link

  • Doppelgänger:
    • Fill each cell of the main grid such that every row, column and box contains a 0 and eight different digits from 1-9.
    • No two rows, no two columns, and no two boxes may be missing the same digit.
    • For each 0 in the grid, the digits missing in its row, column, and box must be three different digits.
    • Fill each outer cell with the digit missing from the corresponding row, column, or box.

  • Adjacent digits on a green German Whisper line must differ by at least 5. Digits separated by space outside the grid are still considered to be adjacent.

  • Full Quad-Rank:
    • All the 2x2 areas of the main 9x9 grid, when read in western reading order, make a total of 64 four-digit numbers.
    • Ranks may have leading 0s.
    • Clues in the center of a 2x2 area show its rank among those 64 numbers, where the lowest is 1 and the highest is 64.
    • For tied ranks, one or more equal numbers are considered to be at rank N when there are N-1 numbers of strictly lower rank. (For example, we say there are three numbers in rank 20 when there are 19 numbers of lower rank and the next rank will be 23, i.e. the ranks could go ⋯, 19, 20, 20, 20, 23, ⋯)

Lösungscode: Digits in rank 44 in wester reading order (4 digits)


Gelöst von lmdemasi, aqjhs, lmg131
Komplette Liste

Kommentare

Heute, 03:30 Uhr von aqjhs
living for the quadrank rep, thanks!

Schwierigkeit:5
Bewertung:N/A
Gelöst:3 mal
Beobachtet:0 mal
ID:000VAD

Lösung abgeben

Lösungscode:

Anmelden