Talk:4-rings or 4-squares puzzle: Difference between revisions
m
→Some missing solutions
| (7 intermediate revisions by 4 users not shown) | |||
Line 27:
d=7 Z7 = 82 -> 2*1 + 2*2*2 + 8*3*3
d=6 Z6 =140 -> 2*1 + 2*2*2 + 2*3*3 + 7*4*4
d=5 Z5 =210 -> 2*1 + 2*2*2 + 2*3*3 + 2*4*4 + 6*5*
d=4 Z4 =290 -> 2*1 + 2*2*2 + 2*3*3 + 2*4*4 + 2*5*5 + 5*6*6
d=3 Z3 =378 -> 2*1 + 2*2*2 + 2*3*3 + 2*4*4 + 2*5*5 + 2*6*6 + 4*7*7
Line 37:
</pre>
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 17:49, 25 January 2017 (UTC)
=Why nearly all write "non-unique solutions" ? =
I think the unique solutions are part of the 2860 solutions.So I think calling them solutions is the right term
--[[User:Horsth|Horsth]]
<pre>
There is a better algorithm for the solutions when they are unique:
Take 1 from 7 as d and leave set of 6 remaining
Take 1 from 6 as 'a' fixing c if part of the remaining set
Take 1 from 4 as g fixing e if part of the remaining set
which leaves 2 values for b.
So maximum of 336 combinations (7*6*4*2) to test, rather than 5040 permutations of all 7.
</pre>
--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 18:29, 25 January 2017 (UTC)
== <del>Some missing solutions</del> ==
<del>It looks like some of the current implementations are missing some of the puzzle solutions.</del> --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 12:55, 10 June 2017 (UTC)
4 5 3 1 6 2 7
7 2 6 1 3 5 4
3 7 2 1 5 4 6
6 4 1 5 2 3 7
6 4 5 1 2 7 3
7 3 2 5 1 4 6
3 8 1 2 4 5 6 <-
3 8 1 2 5 4 7 <-
3 8 2 1 4 6 5 <-
3 8 2 1 6 4 7 <-
4 7 1 3 2 6 5
5 6 2 3 1 7 4
:Re the J solution (reproduced above) Ummm. I think you have a bug in your list generation. Where does 8 fall in 1 through 7? --[[User:Thundergnat|Thundergnat]] ([[User talk:Thundergnat|talk]]) 13:34, 10 June 2017 (UTC)
::Ah, good point. Careless of me. Thanks. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 13:46, 10 June 2017 (UTC)
| |||