Solving Sudoku - Hidden Single (Unique Candidate)

If a cell is the only one in a row, column or block that can take a particular value, then it must have that value. All rows, columns and blocks, must contain each of the digits 1 to 9, so if there is only one cell that can hold a particular value, then it must hold that value.

For example, in the partial Sudoku puzzle below, the marked cell is the only one in block five that can hold a 2, and so it must hold a 2.

Sudoku hidden single example

So why is this technique called hidden single? Simply because if you use a computer assistant (such as SadMan Sudoku) that gives you the full and complete candidate listing for all cells, these cells are the only ones to have a certain digit each, but they're hidden amongst the other candidates for the cell. Contrast this to naked single.

Here are some Sudoku puzzles that can be solved using only naked and hidden singles: (What are .sdk files?)

What People Say

After only one day of free trial, I knew your program was for me and I bought it. It's a superb program! Not only is it mighty when it solves puzzles, it has beautiful human interface quality. I really like it, find I can use it experimentally at several levels, and it is now helping me to understand some solution philosophies better. Great stuff, very reasonably priced, excellent! Thank you, keep up your fine work. PS - Just for a grin, I took a screen shot of one of the fiendish samples from a downloaded PDF from your site. I cropped it into a JPG, and simply dropped it on the Sudoku icon. Wow, it magically just did the character recognition bit, and there was my puzzle! Awesome.
Larry Cunningham, New Mexico
More …

No malware No spam
McAfee Site Report
Web of Trust