| Author |
Message |
adum
Joined: 19 Apr 2007
Posts: 392
|
|
 New levels: 1107 to 1206 |
 |
since Tron has reached 1106, i've added 100 more juicy levels for the world's solving delight! they use tails' generator, and go up to 2000x2000. if and after Tron beats those, i may call it quits and say that's the max. we'll see...
|
|
| Mon May 16, 2011 6:03 am |
   |
 |
ernie
Joined: 22 Apr 2007
Posts: 14
|
|
| |
|
2k x 2k is big but if it was an easy level I think I could solve it.
|
|
| Wed Jun 08, 2011 9:38 am |
 |
|
Tron
Joined: 22 Oct 2010
Posts: 30
|
|
| |
|
Most levels generated by tails' generator are structurally easy. 1132 seems to be tough, though. I know exactly were to start, but even after using two weeks of CPU time the best partial solution misses 101481 cells (The board is 1260x1260 cells large). No other level so far needed anywhere close this much time to solve. I have some ideas to improve my solver, but I need to invest some more time to tackle this.
|
|
| Wed Jun 08, 2011 1:00 pm |
|
|
gfoot
Joined: 05 Sep 2007
Posts: 269
Location: Brighton, UK |
|
| |
|
I'd be really interested to see what that level looks like - would it be OK to share it?
|
|
| Mon Jun 13, 2011 7:50 pm |
|
|
ernie
Joined: 22 Apr 2007
Posts: 14
|
|
| |
|
yeah tails levels are easier. I haven't encountered any hard ones up to 1058. The paths seem to be more twisty.
|
|
| Fri Jun 24, 2011 11:05 am |
|
|
trez0r
Joined: 20 Jul 2010
Posts: 5
|
|
| |
|
Congratulations, Tron!
Amazing work as usual!
|
|
| Mon Oct 03, 2011 5:57 am |
|
|
Tron
Joined: 22 Oct 2010
Posts: 30
|
|
| |
|
I finally solved all 1206 levels. \o/
|
|
| Mon Oct 03, 2011 5:57 am |
|
|
bsguedes
Joined: 24 Feb 2009
Posts: 103
Location: Porto Alegre |
|
| |
|
Congratulations Tron! Very impressive! 
|
|
| Mon Oct 03, 2011 12:08 pm |
|
|
Tron
Joined: 22 Oct 2010
Posts: 30
|
|
| |
|
A few details about my solver: It is 4,500 lines of C, about 1,000 are debug code (output of board statistics, printing the board with annotations, writing logs of calculations, consistency checks). The basic idea is to determine and remove infeasible moves, e.g. "the field at y,x will not be entered from the left side". To solve all the levels, I had to implement methods to reduce the percentage of fields, for which the solver cannot determine, which two sides are used, to about 0.3%. These methods include local patterns, recursive patterns and bounded brute force. Only after application of these pre-calculations I employ a simple recursive brute force search. Solving level 1206 (2000x2000) took 37 minutes.
|
|
| Mon Oct 03, 2011 8:03 pm |
|
|
adum
Joined: 19 Apr 2007
Posts: 392
|
|
|
| Fri Oct 07, 2011 11:29 pm |
|
|
|
