- May 27, 2002
- 12,650
- 203
- 106
I was solving a soduko puzzle last night and it got me thinking...
Do we know if there is a way to prove each puzzle is guranteed exactly one unique solution?
It seems to solve this we would need to know a lot of variables.
Firstly we would probably have to computer the exact number of all possible valid solutions.
I was thinking it would be easiest to estimate (possibly find exactly) by first starting with a 10 digit seed. A seed would be valid if and only if, it is exactly 10 digits and has the all 10 digits appear exactly once. Then developing a tree of all possible valid solutions for that seed. Then we could multiply that by the number of all possible seeds.
From this tree we could hopefully determine the minimum number of starter numbers needed to ensure that this puzzle selects a unique valid solution from the tree.
Im sure the details are far more grueling or possibly easier if you can do it with some matrix operations (which i suck at terribly)... but has anyone given this any thought or even made an attempt?
Do we know if there is a way to prove each puzzle is guranteed exactly one unique solution?
It seems to solve this we would need to know a lot of variables.
Firstly we would probably have to computer the exact number of all possible valid solutions.
I was thinking it would be easiest to estimate (possibly find exactly) by first starting with a 10 digit seed. A seed would be valid if and only if, it is exactly 10 digits and has the all 10 digits appear exactly once. Then developing a tree of all possible valid solutions for that seed. Then we could multiply that by the number of all possible seeds.
From this tree we could hopefully determine the minimum number of starter numbers needed to ensure that this puzzle selects a unique valid solution from the tree.
Im sure the details are far more grueling or possibly easier if you can do it with some matrix operations (which i suck at terribly)... but has anyone given this any thought or even made an attempt?