View previous topic :: View next topic |
Author |
Message |
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Tue Aug 30, 2005 4:42 am Post subject: QWH, order 30 |
|
|
here is a QWH-problem of order 30.
QWH means : "quasigroup with holes" , or latin square with holes.
It's just a sudoku, where you have no constraints with the blocks,
just with the rows and columns. And there can be multiple solutions.
These are frequently used in math-research,
see e.g. http://mat.gsia.cmu.edu/COLOR04
where this problem was picked
(qwhdec.order30.holes316 GOM) .
I'm curious whether such problems can be solved by hand
by sudoku-specialists, or by common 9*9-sudoku computer-solvers,
how far you get and what sort of problems you encounter.
If there is no answer, I'll post smaller problems...
Code: |
UO2I.FK.5.7...L..N..HQ.P4JCBE.
.K..9US..L2..MH.61R...AEOI.8JC
PGOE4.2..TB.UH..L.1....A..NQ95
.5URPON..8...C26I.S.JM7H.G4..1
S.43E..C.2HM.8BKQ.L...JR.A...N
.A.U.1E...L.JBIN97D..R....SKOT
.....G.2.UJSPQ6E1R....O.L..NH7
A..FLSJN.Q9C1.OM.4..5T.KHB.ERI
5.A.JC37P.6EL..T8IG4O9..Q2MF.D
7HEJRK..T3...9..SD.1F..4A.QOU.
.4DK...SCJR6.7Q5O2B9ME.I.18H..
QEM8.A.6.4.....J.FT3K79D..B..O
O.B..I..E5M8....CH9N6...US..L2
GRFOCQPH.1..N..U..A.LSI3TE976M
I3Q.7.4..AT.MN.1.J5S9HP.B...KE
..K..3.TASUDQO.G.LP8NJ19E4IR.H
J.7PK9GF3E.AHUTR4.NLI.B.S.6C28
.2JTQ.BA.G8N.L5O..K.7.3..9P.4S
9N.76.T.MOA..14QB5J.C2DG3R.U.K
2.TGA..BIF15.4DHK.6O.LEC8U..M.
6T1.SHR....K.E7.3..28.4MFQL5GU
..I.MT...H.PKAJ.5.FR.U26..OS19
.CL.IRU...S42.9PNE...B.T.6.A.3
.BS.TMH.O6.9.GKL.P.CU...27.15J
TM6LDBQ.1.KJO2.8.GH.R3.S.PA.N.
.Q9MO45KBRIH.DPSJCE62.8U.T3LFA
8.G9...LRPO7CJ.I..2.14..MKU.D.
MU8.....L..RB.1A7S4HE6T.9OKP.G
.JRSH6..4.PLFKU2T8Q....O5NGM3.
1FH..JO.9NE36..4G..KBC....7D.Q
|
|
|
Back to top |
|
|
| rallveird
| Joined: 13 Jun 2005 | Posts: 31 | : | | Items |
|
|
Back to top |
|
|
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Mon Sep 05, 2005 9:17 am Post subject: |
|
|
thanks, rallveird.
these are hardest usually, when there are about n^1.55*1.7 holes.
So about 330 holes for 30*30 puzzles.
I wonder how the corresponding formular would look like for sudokus.
I had to do a random restart of my solver for some of the problems.
Hardest were 10,16
menneske 30*30 problems:
-------------------------------------------------------------
01: 1 sol. 9503 nodes 260 guesses 5/91sec 629078
02: 1 sol. 50633 nodes 1652 guesses 35/91sec 1004177
03: 1 sol. 239280 nodes 5779 guesses 145/91sec 2470947
04: 1 sol. 43088 nodes 1541 guesses 30/91sec 938221
05:-1 sol. 4000001 nodes 164207 guesses 2855/91sec 37981525
05: 1 sol. 10313 nodes 343 guesses 15/91sec 720924
06: 1 sol. 1558 nodes 30 guesses 0/91sec 560264
07: 1 sol. 1008851 nodes 35263 guesses 690/91sec 9611985
08: 1 sol. 3028483 nodes 113964 guesses 2085/91sec 27837969
09: 1 sol. 1772545 nodes 66739 guesses 1310/91sec 17688410
10:-0 sol. 4000001 nodes 171670 guesses 2960/91sec 39326524
10:-1 sol. 4000001 nodes 157133 guesses 3300/91sec 43798114
10: 1 sol. 110627 nodes 4519 guesses 95/91sec 1764491
11: 1 sol. 735 nodes 8 guesses 0/91sec 556791
12: 1 sol. 18283 nodes 494 guesses 10/91sec 705918
13: 1 sol. 869 nodes 6 guesses 0/91sec 569014
14: 1 sol. 2320237 nodes 87560 guesses 1595/91sec 21444797
15: 1 sol. 46815 nodes 1508 guesses 30/91sec 949283
16:-0 sol. 4000001 nodes 158706 guesses 2810/91sec 37351163
16: 1 sol. 673014 nodes 26158 guesses 570/91sec 8001862
17: 1 sol. 85938 nodes 2469 guesses 55/91sec 1298760
18:-0 sol. 4000001 nodes 217708 guesses 3255/91sec 43171890
18: 1 sol. 12690 nodes 354 guesses 15/91sec 748328
19: 1 sol. 89864 nodes 2605 guesses 60/91sec 1305462 |
|
Back to top |
|
|
| frisch
| Joined: 16 Nov 2005 | Posts: 55 | : | Location: Paris, France | Items |
|
Posted: Tue Nov 22, 2005 10:16 pm Post subject: |
|
|
What is the question of the original post? Finding a solution is easy, but there are a lot of them! Is the problem about counting solutions? |
|
Back to top |
|
|
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Wed Nov 23, 2005 4:27 am Post subject: |
|
|
frisch wrote: | What is the question of the original post? Finding a solution is easy, but there are a lot of them! Is the problem about counting solutions? |
no, just find one solution (QWH)
or figure out whether it can be solved or not (QCP)
the above timings for the menneske problems were done with
my old (slow) program. Cutoff at 4e6 nodes
menneske problems are usually not minimal, you can remove clues
yet there is a unique solution. |
|
Back to top |
|
|
| frisch
| Joined: 16 Nov 2005 | Posts: 55 | : | Location: Paris, France | Items |
|
Posted: Wed Nov 23, 2005 7:57 am Post subject: |
|
|
Do you have a list of Menneske's puzzles in computer-readable form? |
|
Back to top |
|
|
| frisch
| Joined: 16 Nov 2005 | Posts: 55 | : | Location: Paris, France | Items |
|
Posted: Wed Nov 23, 2005 11:03 am Post subject: |
|
|
My timings for the 19 30x30 puzzles:
Puzzle 1: time: 9.263992 ms
Puzzle 2: time: 6.855965 ms
Puzzle 3: time: 11.114120 ms
Puzzle 4: time: 5.496979 ms
Puzzle 5: time: 7.850885 ms
Puzzle 6: time: 8.049011 ms
Puzzle 7: time: 5.131960 ms
Puzzle 8: time: 19.749880 ms
Puzzle 9: time: 27.758121 ms
Puzzle 10: time: 13.806820 ms
Puzzle 11: time: 12.109995 ms
Puzzle 12: time: 9.523869 ms
Puzzle 13: time: 12.587786 ms
Puzzle 14: time: 7.427931 ms
Puzzle 15: time: 13.041019 ms
Puzzle 16: time: 9.640932 ms
Puzzle 17: time: 14.419794 ms
Puzzle 18: time: 9.363174 ms
Puzzle 19: time: 8.731842 ms |
|
Back to top |
|
|
| frisch
| Joined: 16 Nov 2005 | Posts: 55 | : | Location: Paris, France | Items |
|
Posted: Wed Nov 23, 2005 1:55 pm Post subject: |
|
|
Ok, I started to minimize the first one.
Here is the first result:
Code: |
...4.F.E.53S.1UA.MG.LQN7.CTBK.
P..9.J.S8G.DT3QF2E.1.64.7L..C.
S..U...2M.PKFE...3.69R8.A4.DI.
..U.N..F.J...BOP.6.5.K..IT1.EG
G1Q..K..J6.7R..EB..84T...HFMAP
7DIEP1G.C..4.S.B8.HO.MQU..9.5.
....7.MBO.2.S8.3A.TEG.K.UP.6F4
.O.QCUD....P47K.1..TF2BI.AL3..
3TJR..6.KN.BIQ.1G.4H.DPO..5.9L
.S4F..9H.O..QI...7..MC.DJN...6
J...UN.T6H..C...9B..2A1R53D.7.
.GF...1M.A..N.6.J.5I8.HT2OR.BU
IF.D.MK5...HB21.T.NGUJC96RA8.S
.4.8M7S.....JPE6CDBU..9.3KG.Q.
..HK..I.GU..859.41M3.F.6.7N.P2
MC.23.Q.F.R97O.GPJ..DB.N..KA..
.8.7EQ....429.N5.......PDSM.H.
9.PB2GOD.IEJ.4..KN6...351.S.RA
R5.6G2PO.ECU.H.N.T..7.M...QFL.
.E.IB64713..MF...R..5PO.HU...J
U..CFST.9...K...D2..O.AJ..8.N.
5B...T2PR.KN..MQHC1..7.ES..L69
..6NO.C35P1A.R.S7QF....H4JI.8.
1J9.KR...LNT.DPM3U.A.8FQ.E.7..
.9.5..3CS..Q.6G.L.E..N.BMD7I18
BN3PI...247...8..S9.KE..T..QUR
8U.L.D.94.T.H.FJ....C.6..I.G..
.3D.QH.NB18.PAS.F92R..J...6..M
.H..9E.G3.U...5CSIL.6OT.Q.J...
.K8JS.LUT.H51.CIM.Q2B.R.P9....
|
|
|
Back to top |
|
|
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Thu Nov 24, 2005 10:36 pm Post subject: |
|
|
35sec for me to solve.
how long does it take to minimize 30*30 QWHs ?
is it random ?
369 holes , that't 1.89*30^1.55, a little above phase transition.
Can we figure out the phase-transition-formula for sudokus
by creating minimal ones ?
we have
minimal sudokus:
9*9 : 57 holes
16*16 : 165 holes
25*25 : about 350 holes
minimal QWHs
25*25 : 267 holes = 1.82*25^1.55 |
|
Back to top |
|
|
| frisch
| Joined: 16 Nov 2005 | Posts: 55 | : | Location: Paris, France | Items |
|
Posted: Fri Nov 25, 2005 6:56 pm Post subject: |
|
|
I started again my minimization algorithm (now, it chooses the clues to remove randomly). It took 17 minutes to run on a P4 3.2 Ghz.
Code: |
...46F.E.53..1UA.MG9LQN7..TBK.
P..9.J.S8G.DT3QF2..1.64.7L..C.
S......2..PKFE.T5..69R8.A4.DI.
..U.N..F.J...BOP.6.5.K7.IT1.EG
G.Q..K..J6.7R..EB..84T...HF.AP
.DIEP1G.C..4.S.B8.HO.MQ...9.5.
....7.MBO.2.S8.3A.TEG.K.UP.6F4
.O.QCUD....P47K.1.STF2BI.AL3..
3TJR..6.KN.BIQ.1G.4H.DPOE.5.9L
.S4F..9H.O..QI...7..MC.DJN3..6
J...UN.T6H..C...9B..2A1R53D.7.
.GF3...M.A..N.6.J.5I8.HT2OR.BU
IF.D.MK5...HB21.T.NGUJC96RA..S
.4.8M7S.....JPE6CDBU..9.3KG.Q.
..HK....GU..859.41M3.F.6.7N.P2
MC.2..Q.F.R97O.GPJ..DB.N..KA..
.8.7EQ.K..429.N56......PDSM.H.
9.PB2GO.7IEJ.4.8.N6...351.S.RA
R5..G2PO.ECU.H.N.T..7.M1..QFL.
.E.IB64713..MF...R..5PO.HU...J
U..CFST.9B..K...D2..O.AJ..8.N.
5..A.T2PR.KN..MQHC1.37.ES..L69
..6NO.C35P1A.R.S7QF....H4JI.8.
1J9..R...LNT..PM.U.A.8FQ.E.7..
.9.5..3CS..Q.6G.L.E..N.BMD.I18
BN3PI...247..J8..S9.KE.....QUR
8U.L5D.94.T.H.FJ....C.6..I.G..
.3D.QH.NB18.PAS.F92R.GJ...6..M
.H..9E.G3.U.2K5CSIL.6OT.Q.J..1
.K8JS.LUTDH5..CIM.Q2B...P9E...
|
|
|
Back to top |
|
|
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Sat Nov 26, 2005 4:55 am Post subject: |
|
|
this was solved in 6min with my old program and 4sec with
my new, which was a surprise to me. Usually I don't get such differences.
I haven't checked, there could be a bug.
here's one other benchmark from a Regin+Gomes paper. :
www.constraint-programming.com/ people/regin/papers/cardmatrix.pdf
Apparantly it was first solved in 2004 in 9900s .
The solution is somehow obvious to a human, but can your
solver find it ?
qwh order 35, 405 holes:
Code: |
123.56.89ABCDE.GH..K.MN.P.RSTUVWX..
2345..89ABC.E.G.IJKLMNOP.RST.VWXY.1
.45.78.AB.DEFG....L.NOPQR.T.VWXYZ12
.5.7.9.B.D..G.I.K.MN...R.TUVWXY..23
5678.ABCD.FGH.JKLM.OPQRSTU.W.YZ12.4
6789ABCDEFGHIJ.L.NO.QRST..WXYZ1..45
7....CDE.G..JKLM.OP.R.TUV...Z12..56
....CDE...I.KLMNO..RSTUVWXY.1.34.67
9.BCD..G.IJKL.NOPQRSTUVWX.Z.234..78
ABC.E.GH..K..N.PQRS.UVWXY.1.3.5.789
B.D.F.H.J..M.O.QR.TUVWXYZ123.5.789A
CDE.GHI.KLM..PQRSTUVWXYZ123.567.9..
DEFGH.JKL...PQ.STUV..Y.123..6.89AB.
E.GHIJKLMN..QR.T..W.YZ123456789AB..
.GH.J.LMN..QRSTUVW.YZ1.345.789A.C.E
GHIJKLM..P.R.T.V..Y....4..789ABC.EF
.IJK.M.O..R.TUVWXY.....5.789AB..EFG
IJKLM.OPQ.S..VWX.Z1.....789ABCDEFG.
J..MN.PQRSTU.WXYZ1234.6.8.ABC.....I
..MNO..RST.VW.YZ...4..789.B..EFG..J
LMN.P.RST...X.Z12.4.67.9.........J.
..O..RSTU.W..Z1234.67.9ABCDE.GHI..L
.O.QR.TU.WXY.12345...9.BCDEF....K.M
OP..S.U.W.YZ1234.67.9.B.D..G.IJ.LMN
P.RS.U.WX.Z..3.5...9ABC.EFGHIJK.MNO
QRST...X.Z123....8..BC..FGHIJKLMNOP
R..U.WXYZ1234567.9.BC.E.GHI..LMNOPQ
.T..W..Z12.456..9.BC.EFGHI....N.PQR
TUVWX..123.5678.A..D.F.HI.KLM.OPQ..
UV.XYZ..3..67.9A.CD..G..J.LMN.P.RST
.WX.Z12345.789A..DEFGHI..LMNO.Q..TU
.XYZ1.3.56789.BCDEFGH.JKLM..PQRS...
X..1..4567.9ABC.EFGHIJKLMNOPQR..UVW
.Z.2..56789ABC..F..IJKL.NOP.RS..VW.
Z123456...AB.DEFG.IJKLMNO..RSTUVWXY
|
|
|
Back to top |
|
|
| gsf
| Joined: 18 Aug 2005 | Posts: 411 | : | Location: NJ USA | Items |
|
Posted: Wed Nov 30, 2005 7:07 pm Post subject: |
|
|
dukuso wrote: |
here's one other benchmark from a Regin+Gomes paper. :
www.constraint-programming.com/ people/regin/papers/cardmatrix.pdf
Apparantly it was first solved in 2004 in 9900s .
qwh order 35, 405 holes:
|
300.648295 seconds 13567 guesses on 2.8Ghz p4 |
|
Back to top |
|
|
| frisch
| Joined: 16 Nov 2005 | Posts: 55 | : | Location: Paris, France | Items |
|
|
Back to top |
|
|
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Sat Dec 03, 2005 3:14 am Post subject: |
|
|
Satz: 58s
Satzoo: 230s
Guenter: 423s
for these 9. #7 and #9 are hardest |
|
Back to top |
|
|
| dukuso
| Joined: 14 Jul 2005 | Posts: 424 | : | Location: germany | Items |
|
Posted: Sat Dec 03, 2005 3:19 am Post subject: |
|
|
gsf wrote: | dukuso wrote: |
here's one other benchmark from a Regin+Gomes paper. :
www.constraint-programming.com/ people/regin/papers/cardmatrix.pdf
Apparantly it was first solved in 2004 in 9900s .
qwh order 35, 405 holes:
|
300.648295 seconds 13567 guesses on 2.8Ghz p4 |
the Regin/Gomes instances were easy for SATZ.
order 35, 405 holes was solved in 20sec
order 33, 381 holes, balanced was solved in 350 sec.
Looking again at "The Cardinality Matrix constraint" , page 15:
"..remain open for a CP-approach". Does that mean, they are aware
that these are easy for the "SAT-approach" but were only
interested in the CP-approach ?
But in the abstract they write: "Constraint based approaches have
been shown to outperform other approaches.."
The Spanish paper clearly shows that the SAT-approaches are
way better than the current CSP-approaches.
There is also a paper
www.emn.fr/x-info/cpaior/Proceedings/CPAIOR-21.pdf
which seems to be dated earlier but where they solve
qwh35,405 in 113s with a CSP-LP hybrid
and qwh33,381b in 99s with a SAT-solver |
|
Back to top |
|
|
|