Is there a 6x6 suguru puzzle with no initial digits given that
has a unique solution?
I am unfamiliar with suguru [...]
What I have not been able to discover is whether there is an upper limit
on the size of a zone. Is m > N allowed? That is, can a 6x6 puzzle
contain a zone of, say, 7 cells?
In article <r0cebo$4sj$1@dont-email.me>,
Richard Heathfield <rjh@cpax.org.uk> wrote:
What I have not been able to discover is whether there is an upper limit
on the size of a zone. Is m > N allowed? That is, can a 6x6 puzzle
contain a zone of, say, 7 cells?
I hadn't considered that a rule of the puzzle, just a choice made by
the setter.
Here is a 5x5 puzzle which needs no initial digits:
+---+---+---+---+---+
| | | |
|---+---+---+ + |
| | | |
| +---+ +---+---|
| | |
| + +---+---+---|
| | |
|---+---+---+---+---|
| | |
+---+---+---+---+---+
Here is a 5x5 puzzle which needs no initial digits:
Here is a 5x5 puzzle which needs no initial digits:
+---+---+---+---+---+
| | | |
|---+---+---+ + |
| | | |
| +---+ +---+---|
| | |
| + +---+---+---|
| | |
|---+---+---+---+---|
| | |
+---+---+---+---+---+
Nice.
* there is a square array of cells, side N;
In article <r0cebo$4sj$1@dont-email.me>,
Richard Heathfield <rjh@cpax.org.uk> wrote:
* there is a square array of cells, side N;
Actually many examples on the web use a non-square rectangular
array.
I've now worked my way through 1x1, 1x2, 2x2, and 2x3, and I've
satisfied myself that, apart from the trivial 1x1, none of them allow
unique clueless solutions.
3x3 is more of a challenge, and I'm starting to scout around for excuses
not to cut code.
Here is a 5x5 puzzle which needs no initial digits:
And here is a 7x7:
In article <r0d1mh$jsk$1@macpro.inf.ed.ac.uk>, I wrote:
Here is a 5x5 puzzle which needs no initial digits:
And here is a 7x7:
And here is an 8x8:
+---+---+---+---+---+---+---+---+
| | | |
|---+---+---+---+---+ +---+---|
| | | | |
|---+---+ +---+ +---+---+ |
| | | | | | |
| + +---+ + + +---+ |
| | | | | |
|---+ + +---+---+ + +---|
| | | | | | |
| +---+---+ +---+---+---+ |
| | | | |
| +---+ +---+ +---+---+ |
| | | | | | |
|---+---+---+---+ +---+ +---|
| | | |
+---+---+---+---+---+---+---+---+
It can be solved by hand, though it took me a while.
Spoiler alert: solution below (which I >>>think<<< is correct).
I am pessimistic about finding a 6x6, at least with a maximum group
size of 5, as one can easily show it must have at least 10 groups, and
every solvable 6x6 grid I have found so far has either 8 or 9 groups.
Sysop: | Keyop |
---|---|
Location: | Huddersfield, West Yorkshire, UK |
Users: | 322 |
Nodes: | 16 (0 / 16) |
Uptime: | 148:09:20 |
Calls: | 7,072 |
Calls today: | 1 |
Files: | 12,493 |
Messages: | 5,499,283 |