Legend/Key:
n = table number(see below)
c = cell number
Hidden table = the table before the changes are applied
A
B
C
D
E
F
G
H
I
1
2
3
1
2
3
1
2
3
4
5
6
4
5
6
4
5
6
7
8
9
7
8
9
7
8
9
1
2
3
1
2
3
1
2
3
4
5
6
4
5
6
4
5
6
7
8
9
7
8
9
7
8
9
1
2
3
1
2
3
1
2
3
4
5
6
4
5
6
4
5
6
7
8
9
7
8
9
7
8
9
Rules:
* 5-7 changes
* 2-3 randomly blacked out
* Applied in order
* Show a solved table with changes applied
* Show second table to be solved
* Solve hidden table by the rules of sudoku
Changes:
1. letter A→letter B: put letter A in letter B’s spot and vice versa. They assume the letter of the new position and don’t keep their own
2. L, letter, some change: only perform the change on that letter
3. F, an arrow: flip the boxes(cells if on letter) in the direction of the arrow i.e. for → A=C, B=B, C=A, etc.
4. S: swap the c’s in this direction→, change goes across box boundaries
5. +, ×, −, or ÷: perform c the operation indicated n and place the result in the cell
6. −letter: revert the indicated letter to one state prior
S, F←, LG F↑, LI S, ch, ch, ch
2
4
4
0
6
4
7
5
1
4
-1
-4
-1
5
-2
-3
-2
0
2
-7
-4
-5
-2
-4
-5
-3
0
5
0
5
4
7
-2
6
2
0
0
2
-3
-2
3
0
1
-4
3
-6
-3
0
-4
-4
-2
1
-6
-3
4
1
1
8
4
-1
5
0
0
-2
3
0
-3
2
-1
3
0
3
0
1
-8
-3
-5
-1
1
-7
-5
1
6
-1
-2
-2
-1
0
5
4
2
-2
-1
2
-3
-2
-6
-1
1
2
5
0
1
4
-5
5
-4
-2
1
1
0