Thursday, 23rd November 2017
Puzzles Solved Yesterday: 118
Home | Register | Login | Current Puzzle | Archives | Leaderboard | Forum | Tutorial | FAQ
Forum Index
 
Page 1 of 512345>
New puzzle generator
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.10 10:53:32
Hi, I am a student who is working on bachelor thesis with topic SlitherLink. I have just invented new way how to solve (which implies a
generation of course) this puzzle. To this day I have implemented only "easy" version of this solver. I haven't implemeted yet shading
and path deductions, but I am working on it. So it uses only basic rules (such as clues constraints, locks and preventing closing loop too
early). But in comprasion with Loopy, it can solve all hard puzzles. On the other hand Loopy is not able to solve these puzzles. It is the
reason why I wrote that it is "easy" version. The next point of this solver, which I want to mention, is the speed of the program. It is
much faster than Loopy. For example to generate 40x30 puzzle it takes only time for about 14-16 seconds. And the size of all rules I have
implemeted here is 1308 bytes I post here some of puzzles from my generator and I would be delighted for your feedback - how difficult
were puzzles for you and so on. It would help me to my future work. It is also the reason why I didn't post puzzles to the User Puzzles
and why I created this thread. And apologize my english.. Thanks for your comments.

Note: No need for try-fix, but in many cases I am not able to solve these puzzles without it. Only deductions

http://www.kwontomloop.com/puzzlef.php?loopy=6x6:b1b3210a2a23b1322a22b1a2c2d

http://www.kwontomloop.com/puzzlef.php?loopy=10x10:3b3b122a22b2a2c2b0b02c1310a2b1a2b1c1c221b31a21c1c1a121a0b21a2a31a3d21b1a21a

http://www.kwontomloop.com/puzzlef.php?loopy=10x10:02a12b31g1b1a3b3a1a1b2e31b1b2321b21c12b311b223a2a1a3h3b3b1e3a2332a

http://www.kwontomloop.com/puzzlef.php?loopy=10x10:2a1b2c2211c312a2a2i0a1a23a133a2b23c11a2g2d1012b1g2a02a1a3b3d222a

http://www.kwontomloop.com/puzzlef.php?loopy=30x20:3d131a1b2b3a2c1a13d2b210b2b112a23a331a3a2a101a23d0a2b11b1i2c2b333a1b2f1d01b22c2a2a22c3b3133a3a2b1b3a2111c2a2a1a0g2a21a3b1b2221a1f2a122a23d3b2c32a21c32a121d012a1a2b22c1a2a3c0b1b1a1c13l0220d2a22312b13b0a2b103e0c2d0a2d2b02b1a1a2b2221a1a3102c1c3b222e2d2a2a2c2a123b1g2a2b103a3d21a3a2c131a22a2e2d0c2a213a12c1a3c1a11a33a3a2a2a1b1a1121a011c2c1b1b11212b2a11a2a1b0a2c33231a3a22d3c2c2a1b1a2d1d3b1b3a3a231b2a2a1b3b2a1a2b22a1c2

http://www.kwontomloop.com/puzzlef.php?loopy=40x30:1a1a3e222a3a22122c210b2c2223b21a2a111d12e1a3a0c2a2222b2d1a2a21323a1c101b10a0a1311c3c12313d3b121a3c2a3b01a32c022c11b2b21h2a3a1a1d2e2c2c2a2a1b0222a3a31a1b0121e2220b22a121a13b32f222a12a2a22a1b1b2a1d11a3a2a12c1122a2b2b12a1c2b1a2a1a10c12d122a2b221a0c2a2c1a011a3a0a11b1a3a21b20e2c2c2b22a2b20a2b1a123112a22a3a10e132b21a22b2c13a2a11b3a1a2a11a13b2321e12c2c2b2b2111a1a1b1d112a2a3220b20a21d2a33d32f2a3d1h11d1b1b2a221a13a1a3b3a32a21c31c0a0a3b2a1a1a2a2f1c11d311a12b131e1b212203b3c1022b2c2a0d2b1121b20d2c123a1d2a3d1a21b0e1b0a1a11a1a132a1c1a2d0a22b2a2b2110a1d3a2c1c3a1b2a2a3e1b3a2221b1b3a2a2b0202b10a0a2a2e23a2a1e3a1a211b12h1a1b22f21a33b2c3d1a1c122a1a32b2c21212a2e11c22d3a1d012b133222f1a32c10a1a2a212a10a02b2g1222b1c222b21c21c113b2a223a2b0a2d13c2d12a32a1b1a22c2a2a22c2a2c2a1a332a3a1c21121c21d1131121a222023a3a21b2b323d3a2112a3a3b0b1c210c12a2a2e2a212b111b22b2a233b22b33a

http://www.kwontomloop.com/puzzlef.php?loopy=40x30:a22a2a1a2d213c22b132b32a2a11b3a3b2a11a22a122c1112d21c112a2a11a2a3a22a3a20b21e21111a0c2b212d112a11a11a1b3a2a01c3b2a3b1c23b3a1d0e1a3a0e1123b1a2a232c1a0b30b3a13c12b2a1c1c22a11112323a23a2a2a11a311a1b1212c01a2a22b32d1c2d1c2a2c21a12c2a0b22a23a312122a2a1b02b2b3c2221b1b0a11d22213c123c222102211a2a2212d2a1b323a1b1a2d2d2b22a1111b32h1a1a121123a22a3a2a1a3c31e211223a122a22a111c1f3a1a2a2a2a32a222a23f3a121a20a00a21a1c12a32b2a21d22c110b212d0b011a13b1a2b1b13a32a121e2b11a22a11g23a2a222b12221312b122a01b1a3c31a22a12c1a12e2a2b22a2b3a3b211a2b2c2a2b11b21b3a22a21223c2f1221a223b11f12a2b1d1a2a21b0b22a33b31b31a1221a2c211a232b132301b12201a1a00d2a32c22b3b12f2a2b3a1e2c1a31312b1e2a222b31c2b23a33b2g130a23a1e2a3a1b2a31a1h1311d2a2d3a2b123b20c32e2b1a0d3c1c3a332a1f3a123a20012231c3c3a2a11d1a3321a2b2g2a22a11a23a2b2b221b3d3a13b2112a3a2c1b3b2b3b1a2a1a22221b0b1a1132a221c0c1a13a2b1321b3d23b2a2a22c3a3a23a1a1a2b121
Last edited by v_e_e_n_c_a - 2009.04.10 11:24:34
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.15 08:11:45
Some more 10x10 puzzles (easy). I am working on shading system now - it would be able to produce harder puzzles later.

http://kwontomloop.com/puzzlef.php?loopy=10x10:22a3b2a22a32a2c1b2a2b222f1132a31a1a3c2b3e3b13a3a32a1222a2b2a3c3a3b12a2h
http://kwontomloop.com/puzzlef.php?loopy=10x10:3a2a3c13a12b2f2a2b31a3d2c230a12d22b3b2d12b3j2221b23f3a3c2a20
http://kwontomloop.com/puzzlef.php?loopy=10x10:g1c3b32c2c1e3202a3a12a2a3b1c3312c1e22a32c32d11a23c13a3b23a23c3b
http://kwontomloop.com/puzzlef.php?loopy=10x10:a2b2a222a3a21a3a2h21b32a2a2a1b312e22b2a21302a23b20b3c2d0a21b1a032d3a3d3
http://kwontomloop.com/puzzlef.php?loopy=10x10:a2a2a23a133f1c21a03c3b12c1a32a1b1a1e2c1b33e22220b2a20a3d2b23c1f3
Jankonyex
Kwon-Tom Obsessive
Puzzles: 3672
Best Total: 9m 35s
Posted - 2009.04.15 11:50:47
Nice easy puzzle #391:
solution
Last edited by Jankonyex - 2009.04.15 11:52:27
Brian
Kwon-Tom Obsessive
Puzzles: 3129
Best Total: 9m 29s
Posted - 2009.04.16 07:20:02
I like these puzzles a lot. Thanks.
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.16 07:27:40
Thanks for feedback.. I am pleased that you enjoy these puzzles.. I can publish here some more puzzles if you want.. Just say what sizes you would prefer - small puzzles (10x10) or beasts or the size as weekend puzzles are..
Brian
Kwon-Tom Obsessive
Puzzles: 3129
Best Total: 9m 29s
Posted - 2009.04.16 07:53:44
The weekend-sized (20x14) ones are my favorite, although the smaller ones are nice too. I don't like the beasts as much--they take too much time, and I have to squint and/or scroll--but of course everyone has different preferences.
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.16 08:00:32
Ok, here are some specially for Brian. (Each of them was generated in 1 second) Enjoy them..

http://kwontomloop.com/puzzlef.php?loopy=20x14:a22d3b20c0a3a312b33b2d132a02d21c3a2b221b223a1a3a2a2c1c22b311c2b22b3a3d22c2b22a21b213b322312b3a3b323a32221b322a31a1a1b1b1a1b2d2222c22a2f2d3a3a32b3e2b3b2c12b2c3b1b2a2a12a3b3b2b32e32a2e2332b202321a2b1a3

http://kwontomloop.com/puzzlef.php?loopy=20x14:31a3e2b312222a32a2a13d3a31j22a3a3b2a3a1a32a2b222b1a312e0a32a2a323e2213f3a12b0b2a1a2a2a3b3e12b1a3b21a2a1a1a3b10a2b2e2a2c2a2b23d12a1b312d322211a232b22a231b1d02a2b2c1c20b1a12a3a2c2a32d223a3a22a23b2c3b3d

http://kwontomloop.com/puzzlef.php?loopy=20x14:a232c1b1a323a212a22a2222e12211e23a23a2g3a3a23c2b3b22223222b1b2a322b2a2b2b1d1h0d22b3a12d3a3a212c2a32a1a12a2d1b3a3c2c2a322a22a12b3a32b2a22e222a21a31a2a31a2b22a1a3a11a1d2221213c3a3b131a3a3a2a3e3a22c2232d2213a

http://kwontomloop.com/puzzlef.php?loopy=20x14:a2b3a23a2b1a32a3b3a3b2a2c3f12c2a1a1b3c3a23122c22e32b2b231c2b2222a0d1b3d2b2a23c2b2a32b3a2d0a1121g3c3a2a1a2c21a33c2a23a22d2a2c2b2a22b3a223a3a322b33b2a0b1a2c1b2c2a2a231a3b11b2a2b2a2b22032b13d1a2b12f1a

http://kwontomloop.com/puzzlef.php?loopy=20x14:32d23b3a21a223c3a1a1031c0e121c3a2b1a32322232b3f32f2c2a23a1a2c202b33a23a1e1b2b2a1a12b1b231b1111222c3a231b2213f213a11d12a13a222a21e232e1a22b1a23d223a2b1132b32a2b22c1a3d2133a3a2a223a3a31a2132b1a2a3a3b2a32d23
Last edited by v_e_e_n_c_a - 2009.04.16 08:07:15
Brian
Kwon-Tom Obsessive
Puzzles: 3129
Best Total: 9m 29s
Posted - 2009.04.16 08:55:20
Quote:
Originally Posted by jankonyex
Nice easy puzzle #391:
solution
I don't understand why the ? must be a line, could you explain?


My solution: here
Brian
Kwon-Tom Obsessive
Puzzles: 3129
Best Total: 9m 29s
Posted - 2009.04.16 08:58:56
Quote:
Originally Posted by v_e_e_n_c_a
Ok, here are some specially for Brian. (Each of them was generated in 1 second) Enjoy them..
Thanks! Just 5 seconds, that's amazing! My solver takes an hour to generate a puzzle of that size...
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.16 09:20:03
Quote:
Originally Posted by brian
Quote:
Originally Posted by v_e_e_n_c_a
Ok, here are some specially for Brian. (Each of them was generated in 1 second) Enjoy them..
Thanks! Just 5 seconds, that's amazing! My solver takes an hour to generate a puzzle of that size...

I have just tried to measure time needed for generation. I generated 10 puzzles of size 20x14.. The average time to generate one is 784,64 ms (so less than second) - minimum is 717,6 ms and maximum 826,8 ms. Tested on my notebook with Intel Core2Duo 2GHz and 3GB RAM.. Puzzles were of same difficulty as I have posted here..
Jankonyex
Kwon-Tom Obsessive
Puzzles: 3672
Best Total: 9m 35s
Posted - 2009.04.16 13:32:56
Quote:
Originally Posted by brian

I don't understand why the ? must be a line, could you explain?
unique solution...
MadPAM
Kwon-Tom Obsessive
Puzzles: 735
Best Total: 29m 3s
Posted - 2009.04.16 13:34:51
Thanks for the puzzles. For me the 10x10 rate at about Thursday/Friday level. Maybe I just need to still know more patterns..

Sorry to hijack this topic. But I am trying to get these Solutions to work. But when I load the files into loopy.exe (r7817), I only see the puzzle. When I click solve, they are only solved to the usual level. But how do I get loopy to display the moves as detailed in the solution file? Please help!
Jankonyex
Kwon-Tom Obsessive
Puzzles: 3672
Best Total: 9m 35s
Posted - 2009.04.16 13:37:22
Quote:
Originally Posted by brian
y solution: here
your solution is much better and logical.
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.19 19:05:36
Added very simple coloring - just the relation opposite and same color, no other coloring rules yet implemented.. But I am working on it.. Puzzles should be a little bit harder now (It can solve about 20 percent more than without this feature)

Some puzzles generated (10x10). I will be glad for your feedback..

http://kwontomloop.com/puzzlef.php?loopy=10x10:223a312a32f2b222f2c3a23a212b1a022d1a3c233a22h22a2c23b121222a2a2a3a3b3a
http://kwontomloop.com/puzzlef.php?loopy=10x10:b2b3b1322a2a2d3a2a232212a2b3a2d3e131a1a1a3a2c311a2a1h11c3b3f21b23322
http://kwontomloop.com/puzzlef.php?loopy=10x10:a22322a2e0b1121a22a3b3a223a1b2a13b12a22a12b2a1g112213121c121b222e2a2a22a31a2b
http://kwontomloop.com/puzzlef.php?loopy=10x10:a22c31a3c0c1e2c3a323d0a1a1a2a3a23a2112g1a2a3a231b2a2b3a2f2f2a2a3a22
Last edited by v_e_e_n_c_a - 2009.04.19 19:08:26
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.20 16:34:46
Quote:
Originally Posted by v_e_e_n_c_a
Added very simple coloring - just the relation opposite and same color, no other coloring rules yet implemented..

Now implemented all basic coloring rules - constraints on clues (eg. 2 same colors and 2 opposite colors around clue 2) and in fact also a rule which Navioj calls "diagonal rule" and so on.. Now I am working on path deductions and then on sophisticated region deductions (regions detection and interaction - eg. basic rule even number of lines)

If you want some puzzles to try, I will post some..
Last edited by v_e_e_n_c_a - 2009.04.20 16:37:25
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.20 19:52:38
Here are some puzzles: rating medium (in terms of used methods - basic constrains + coloring)


http://kwontomloop.com/puzzlef.php?loopy=10x10:3a3a21a23b22b1b21a1d1a32a23c2h23c3b23b2b1b2e21b2c1a32c2132a2a333a1a1a3
http://kwontomloop.com/puzzlef.php?loopy=10x10:3333a31b3d2a2c32b2d0d3a2b0a33a2b2b3i32e112a0d22c2b32a2b3a2a3a22b
http://kwontomloop.com/puzzlef.php?loopy=10x10:2a1a232a2b3a32a32a2a2d2a32b2a2c221a2a12c2b2c1d13a3b1a23a301221a32g1a3f213
Jankonyex
Kwon-Tom Obsessive
Puzzles: 3672
Best Total: 9m 35s
Posted - 2009.04.21 07:16:16
are there any topic discussing coloring rules?
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.21 07:49:46
Quote:
Originally Posted by jankonyex
are there any topic discussing coloring rules?

I think that a little bit was discussed here but I don't remember where (and am lazy to search it). But in fact basic coloring rules can be deduced by anyone. It is based on a "cross" around the clue (one cell up, one cell left, one cell right and one cell bottom - to this actual clue). If you know the relation (same/opposite) between some of colors on this "cross" you can make some deductions (deduce colors, edges or locks):

Eg: for clue 1:

if you know that two cells on the "cross" around 1 are in same relation (eg. their color is red), then clue 1 has to be in the same relation (so due to this example it has to be also red colored and from it implies two crosses) - just simply if it had opposite color than there would be 2 lines, which is not acceptable for clue 1.

or for example if you know two colors which are in opposite relation (eg. one red and one yellow) on the "cross" around clue 1 then two remainding edges around clue 1 (I mean edges connecting clue 1 and cells with unknown colors) has to be crosses.
And lot of more deduction should be made - and not only around clues, also around dots.

I think that Navioj discussed his "diagonal" color rule in User beast discussion but I am not sure..
Tilps
Kwon-Tom Obsessive
Puzzles: 4174
Best Total: 20m 22s
Posted - 2009.04.21 08:22:34
My solver has an 'advanced' cell shading rule. Which involves target numbers, but I'm not sure if any of the cases are actually useful unless the edge lock/antilock feature is disabled. 

Basically if you have two cells which are shaded, and they share a common cell in between, the edges to the common cell are either locked or antilocked. 
The locked/antilocked edges combine with the numbers to generate more lock/antilock edges or simply more filled in edges, which then generate cell shading. 
All the number rules I have can be derived from following that process.
Last edited by Tilps - 2009.04.21 08:24:00
v_e_e_n_c_a
Kwon-Tom Obsessive
Puzzles: 930
Best Total: 38m 37s
Posted - 2009.04.21 08:40:19
Quote:
Originally Posted by tilps
My solver has an 'advanced' cell shading rule... Basically if you have two cells which are shaded, and they share a common cell in between, the edges to the common cell are either locked or antilocked.

Yes, it is what Navioj calls "diagonal rule".. I have also implemented this in very quick manner..

Quote:
All the number rules I have can be derived from following that process.

I have implemented a little bit more.. Imagine that you have clue 1, and cell up to thic clue is red and cell under this clue is yellow. Then you can deduce 2 crosses, which is not possible from locks/antilock..
Page 1 of 512345>

Forum Index