|
![](/i/fill.gif) |
>> I presume they were talking about the generalised problem of an n^2 x
>> n^2 grid...
>
> Has it been proven that it's possible to create unambiguous sudoku
> problems for all possible values of n?
If the number of unknowns is small enough, it should be possible to make
it unambiguous. (E.g., if you have a 100 x 100 grid with 1 cell blank,
how hard can it be to figure out what the final value is?)
>> Even if we assume 9x9, it's interesting to note that in paper the
>> process is O(1), and yet the amount of time it actually takes me to
>> solve one appears to be unbounded.
>
> It cannot be unbounded because the number of possible permutations is
> fixed.
So there we have it then: An absurdly inefficient algorithm! :-}
Post a reply to this message
|
![](/i/fill.gif) |