Let's play the seventh Sudoku game at third level of hardness
This is the 7th game play session at Sudoku third level of hardness. This game proceeded uninterrupted forming multiple cycles in a row or column and after using the benefits of the cycles reverting back to the basic row column scan. As such no single action in the game could be identified as the game changing turning point action.
Overall strategy adopted and techniques used
As a strategy we always try first, the row-column scan to find the valid cell at any stage because that is the most basic and easiest of all techniques.
Hardness level being higher now, easy breaks by row-column scan are few and far between. We had to use in general the method of enumerating small length (2 or 3 digit long) Digit Subsets possible to be placed in favorable cells and writing down the DSs in the cells. This act of writing down the DSs in empty cells helps later in identifying a valid digit by Digit Subset cancellation.
Occasionally, these DSs give rise to Cycles in the corresponding row, column or 9-cell square immediately simplifying the situation. Or sometimes we are able to pinpoint a valid cell by analyzing the DSs in empty cells of a zone with respect to other interacting zones when we find only one digit is left for placement in the cell, rest eliminated. We call this technique as Digit Subset Analysis or DSA in short.
Structure and use of a cycle
Form of a cycle: In a Cycle the digits involved are locked within the few cells forming the cycles, they can't appear in any other cell in the corresponding zone outside the few cells forming the cycle. For example, if a 3 digit cycle (4,7,8) in column C2 is formed with a breakup of, (4,7) in R1C2, (4,7,8) in R5C2 and (7,8) in R6C2, the digits 4, 7 and 8 can't appear in any of the vacant cells in column C2 further.
If we assume 4 in R1C2, you will find R5C2 and R6C2 both to have DSs (7,8) implying only digits 7, and 8 and no other digit to occupy the two cells. This is in fact a two digit cycle in the two cells. Together with 4 in R1C2, the situation conforms to only digits 4, 7 and 8 occupying the set of three cells involved in the cycle.
Alternately if we assume 7 in R1C2 (this cell has only these two possible digit occupancies), by Digit Subset cancellation we get, digit 8 in R6C2 and digit 7 in R5C2 in that order repeating the same situation of only the digits 4,7 and 8 to occupy the set of three cells.
Effectively, the three digits involved cycle within the three cells and can't appear outside this set of three cells. This property of a cycle limits the occupancy the cycled digits in other cells of the zone involved (which may be a row, a column or a 9 cell square) generally simplifying the situation and occasionally providing a breakthrough.
Use of a cycle: In this case, if a vacant cell R8C2 in column C2 has a possible DS of (1,4), as digit 4 has already been consumed in the cycle (4,7,8) in the column, only digit 1 can now be placed in R8C2. This is how a new valid cell is broken through which otherwise we were not able to find out in any other way.
How a valid cell is identified by Digit Subset Analysis or DSA in short
Sometimes when we analyze the DSs in a cell, especially in highly occupied zones with small number of vacant cells, we find only one digit possible for placement in the cell. We call valid cell identification in this way as Digit Subset Analysis.
For example, if in row R4 we have four empty cells, R4C1, R4C3, R4C6 and R4C9 with digits left to be filled up [1,3,5,9] we say, the row R4 has a DS of [1,3,5,9] that can be analyzed for validity in each of the four empty cells.
By the occurrence of digits in other cells if we find in only cell R4C1 all the other three digits 3,5 and 9 eliminated as these are already present in the interacting zones of middle left 9 cell square and the column C1, we can say with confidence that only the left out digit 1 of the DS [1,3,5,9] can occupy the cell R4C1.
This is how we identify a valid cell by Digit Subset Analysis.
Let us play the game now.
The Sudoku 7th game play at third level of hardness
First valid cells, R2C2 2, scan R1,R3 -- R9C1 4, scan C2,C3,R7 -- R8C8 4, scan R7,R9 -- R5C9 4, scan C7,C8,R6 -- R3C5 4, scan R1,R2,C4 -- R4C6 4, scan R5,R6,C4,C5 4 over -- R1C3 5, scan R2,R3,C2 -- R4C1 5, scan C3,R5 -- R9C8 5, scan C7,C9,R7.
Then the next few valid cells, R7C8 6, DSA [1,2,6,8] in bottom right 9 cell square -- R6C9 9, DSA [1,6,8,9] in C9 -- R5C8 3, DSA [3,7,9] in C8 -- R2C8 7, DSA [5,7] in C8 -- R1C8 5 -- R6C7 7, DSA [6,7] in C7 -- R4C7 6 -- R2C7 8, DSA [1,2,3,8] in C7 -- R7C7 DS [1,2] forms a cycle of (1,2) in bottom right 9 cell square -- R7C9 8 -- R3C7 3, cycle (1,2) in C7 -- R3C4 8, scan R1,R2 -- R5C5 8, scan C4,C6,R4,R6 -- R8C3 8, scan R7,R9,C2 8 over -- R6C5 2, scan C4,C6,R4 -- R5C1 2, scan R4,R6,C2 -- R7C3 2, scan C1,C2 -- R7C7 1, DS cancel -- R9C7 2.
Valid cell coloring
The first stage valid cells are colored light blue and the solved stage cells colored sea-green. This use of different colors makes it easier to recover from mistakes and also eases explanation and following the game flow.
The results achieved till now are shown below.
This final stage starts with, R6C4 5, Cycle (1,3) formed in R6 -- R3C3 9, DSA [1,3,9] in C3 -- R4C3 3, DSA [1,3] in C3 -- R6C3 1 -- R5C2 9 -- R6C6 3 -- R3C1 7, DS cancel -- R7C1 9 -- R7C5 3, scan R8,R9,C6 -- R1C2 3, scan R3 -- R3C2 6 -- R9C2 7, scan R8 -- R8C2 1 -- R7C6 7 -- R8C5 5, scan C4,R9 -- R3C9 1 -- R1C9 6 -- R8C4 6.
And the last few cells, R5C6 6, scan R4,C4 -- R5C4 1 -- R2C5 6, scan R1,C6 -- R2C6 9, DSA [7,9] in R2 -- R2C8 7 -- R1C8 9 -- R1C6 1 -- R1C5 7 -- R4C5 9, DSA [7,9] in R4 -- R4C4 7 -- R1C4 9 -- R1C5 1. Game solved. End.
The final result is shown below.
As usual we leave you here with a new game to solve.
Eighth game at Third level of hardness