Solving with naked triples

sd9981 · Posted: Tue Aug 08, 2006 9:10 am Post subject: Solving with naked triples

The three grid with '12' ,'23','13',They are naked triples.But I don't know how to find it with programmer.

Can you give me some idea?

daj95376 · Posted: Tue Aug 08, 2006 4:37 pm Post subject:

A row/column/box has a generic name called a unit. You probably know this, but I need a point of reference for my explanation.

The first thing you do is scan a unit for a cell with 2-3 candidates. Call it cell A. Now, continue scanning the unit for another cell with 2-3 candidates and call it cell B. If the combined number of candidates in A+B equals 3, then continue scanning the unit and look for another cell with 2-3 candidates and call it cell C. If the total number of candidates in A+B+C is again equal to 3, then you have a Naked Triple in those cells.

If the test fails at any point, then you continue scanning until the conditions for cells A, B, and C are met ... or else you run out of cells in the unit.

Now, the above is a generic description based on no information about your data structures. If you have implemented bitmaps, then a whole different logic can be employed.

Have fun applying the same principles to Naked Quads. Fortunately, you don't need to do Quints.

sd9981 · Posted: Wed Aug 09, 2006 1:25 am Post subject:

Thanks