SudokuIQ
[ (x + n) mod 9 ]
i
Explanations:
• x – original Sudoku digit (1–9)
• n – 3×3 block number
• s – encrypted symbol
Example (block 1):
x = 5 → s = [5 + 1] mod 9 = 6
s = 6 → x = [6 − 1] mod 9 = 5 ✅
• s = [x + n] mod 9
How to play SudokuIQ – Modulo 9
Each 3×3 block has its own encryption number n (from 1 to 9).
Every original Sudoku digit x (from 1 to 9) is encrypted into a symbol s using the rule:
s = (x + n) mod 9
x – original Sudoku digit (1–9)
n – block number (1–9, counted left to right, top to bottom)
s – encrypted symbol (0–8, zero is possible)
Examples:
• Block 1 (n=1): x = 5 → s = (5 + 1) mod 9 = 6
• Block 3 (n=3): x = 9 → s = (9 + 3) mod 9 = 3
• Conversion to zero: Block 2 (n=2): x = 7 → s = (7 + 2) mod 9 = 0
• Passing through zero: Block 5 (n=5): x = 8 → s = (8 + 5) mod 9 = 4
Your task: solve the Sudoku using only the encrypted values.
You can either:
• decode each 3×3 block separately by converting encrypted numbers into the digits of standard Sudoku,
• or solve the entire puzzle without decoding, working only with the encrypted values.
Important:
Encrypted values do not follow the standard Sudoku rule in rows and columns, because each block is encrypted differently.
The hidden solution is still a standard Sudoku, where every row, column, and 3×3 block contains digits 1–9 exactly once.