| Subject: | Re: A SuDoKu question |
|---|---|
| From: | "Proginoskes" |
| Date: | 17 Sep 2006 23:03:31 -0700 |
| Newsgroups: | sci.math |
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?
In my experience, if I make a mistake in Sudoku, I catch it fairly
quickly; before the next three or four numbers.
--- Christopher Heckman
|
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: How C programming got me in trouble with the law, Phil Carmody |
|---|---|
| Next by Date: | Re: JSH Center for Advanced Research. Looking for an example of :, Sue |
| Previous by Thread: | A SuDoKu question, Bob Kolker |
| Next by Thread: | Re: A SuDoKu question, Sue |
| Indexes: | [Date] [Thread] [Top] [All Lists] |