Sudoku Pattern: Naked Singles (Single Candidate in a cell)
Anyone can learn how to play Sudoku! Start with this first step.
In this very basic pattern, one looks for cells in the Sudoku puzzle that can have only one candidate in it. For a given cell, eliminate as candidates all the numbers that are already known on the same row, column or box. If only one possibility is left, then we have a single candidate pattern.
In the example below, the cell on row 9, column 7 (shown in green) can have only the value 3, because all the other numbers are 'used up' on the row, column, or box that this cell is in. Thus '3' is the solution to this cell.
In the second example below, the cell on row 4, column 3 (shown in green) can have
only the value 8, because all the other numbers are 'used up' on the
row, column, or box that this cell is in. Thus '8' is the solution to this cell.
