Hi,
As a newcomer to the forum, I wish to share my experience with you and if possible receive some feedback.
---------------------------------------------------------------------------
Another Way to Represent Candidates
When I do sudoku, I do the usual slicing and dicing until I come to a dead end. Then I take a plain sheet of paper and put down the candidate situation of the nine blocks as it is at this stage. The blocks are numbered from 1 to 9 in a left to right, up to down fashion and in the same way I relate to each empty cell within each of the 9 blocks. Taking the following block of a puzzle as an example:
{ 6 4 * }
{ * * 7 }
{ * 1 * }
I notice that there are 5 missing candidates in this block. They are: 2 3 5 8 and 9, which means there are also 5 empty cells in wait to be filled by the above mentioned candidates. So I relate or enumerate by heart the empty cells from 1 to 5 in the same left to right, up to down fashion. Then, upon the sheet of paper I put down the 5 candidates in 5 rows, each row for one of the 5 empty cells, in this way:
2 3 5 8 9
2 3 5 8 9
2 3 5 8 9
2 3 5 8 9
2 3 5 8 9
and start checking each cell, crossing out the candidates that arent possible for that cell. For example, if after examination, the above table of candidates would look like this:
2 3 5 8 9
2 3 5 8 9
2 3 5 8 9
2 3 5 8 9
2 3 5 8 9
it means that nothing was yet achieved. So I go on to the next block, make a table of its candidates and cross out those which are not feasible for its empty cells. Now, if Im more lucky and my present table looks like this:
2 4 5 6 7
2 4 5 6 7
2 4 5 6 7
2 4 5 6 7
2 4 5 6 7
it means that we have found 6 to be a naked single for cell No.1 and cell No.3 to be the only single candidate cell which may receive a 4. So I encircle the 6, cross out horizontally the first row of candidates for cell No.1, cross out vertically all other appearances of 6 in column 4 of the table, and fill cell No.1 with a 6. Next I do the same with the 4 in column 2, row 3 and fill cell No.3 with a 4. If possible, I then update the table of candidates of the preceding block and see if a breakthrough can be achieved there, or in the neighboring blocks. The updating is very important. Not doing it acurately or not doing it at all, leads to disaster. Only in the final stages, when your puzzle falls apart like a house of cards, may you afford not to update.
By the way, instead of making tables of candidates for blocks, you can do the same for rows and columns, or in emergency conditions you may even choose to do it in addition to tables for blocks. Once I did so and was surprised to crack down on a candidate which came in view only by means of a column table representation.
Of special interest to the solver are pairs, and maybe triples or quads. Fortunately, these too are quite visible in such a candidate representation. Sometimes, in order to get a better view of the pairs orientation, I pencil them in, in the usual way, but never do I clutter the puzzle with the galaxy of all other candidates.[/u]