Ad blocker interference detected!
Wikia is a free-to-use site that makes money from advertising. We have a modified experience for viewers using ad blockers
Wikia is not accessible if you’ve made further modifications. Remove the custom ad blocker rule(s) and the page will load as expected.
In sudoku, you have a board with 9 boxes, each with 9 spaces aranged in a square pattern. In every row, column, and box on the board will have only 1 occurance of the numbers 1-9. You must logicly assign the missing numbers using the given numbers as an axiom.
Here is an example using 4x4 board instad of a 9x9.
|| 4 | 1 || a | b ||
|| 3 | 2 || c | d ||
|| e | f || 3 | 2 ||
|| g | h || 4 | 1 ||
a = 2 (2 is the only number both the row and column are missing) b = 3 (if a = 2, it is the only number left in the row) c = 1 (if a = 2, it is the only number left in the column) d = 4 (with the rest of the box, row and column filled in, it can be nothing else)
e = 1 (only number both row and column are missing) f = 4 (if e = 1, it is the only number left in the row) g = 2 (if e = 1, it is the only number left in the column) h = 3 (it is the only number left in the row, column and box.)