|
|
Bob Kolker wrote:
To check to see if a proposed solution is really a solution one can
check all the rows , all the columns and all the sub boxes for
non-repitition. Is all this checking necessary to establish
correctness? What is a procedure with minimal steps to check the
correctness of a SuDoKu solution?
Here is an upper bound for a minimum. Check all nine rows, then eight
columns and eight nonets. If all these check, the remaining column and
nonet must check. Can someone here come up with and example to show
this bound is tight?
--
Stephen J. Herschkorn sjherschko@xxxxxxxxxxxx
Math Tutor on the Internet and in Central New Jersey and Manhattan
|
|