New levels: 1107 to 1206

Post Reply
User avatar
adum
Posts: 392
Joined: Thu Apr 19, 2007 12:49 pm
Contact:

New levels: 1107 to 1206

Post by adum »

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...
User avatar
ernie
Posts: 14
Joined: Sun Apr 22, 2007 1:22 pm
Contact:

Post by ernie »

2k x 2k is big but if it was an easy level I think I could solve it.
Tron
Posts: 30
Joined: Fri Oct 22, 2010 6:59 pm

Post by Tron »

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.
gfoot
Posts: 269
Joined: Wed Sep 05, 2007 11:34 pm
Location: Brighton, UK

Post by gfoot »

I'd be really interested to see what that level looks like - would it be OK to share it?
User avatar
ernie
Posts: 14
Joined: Sun Apr 22, 2007 1:22 pm
Contact:

Post by ernie »

yeah tails levels are easier. I haven't encountered any hard ones up to 1058. The paths seem to be more twisty.
trez0r
Posts: 5
Joined: Tue Jul 20, 2010 7:16 am

Post by trez0r »

Congratulations, Tron!
Amazing work as usual!
Tron
Posts: 30
Joined: Fri Oct 22, 2010 6:59 pm

Post by Tron »

I finally solved all 1206 levels. \o/
User avatar
bsguedes
Posts: 103
Joined: Tue Feb 24, 2009 12:39 am
Location: Porto Alegre

Post by bsguedes »

Congratulations Tron! Very impressive! :-)
Tron
Posts: 30
Joined: Fri Oct 22, 2010 6:59 pm

Post by Tron »

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.
User avatar
adum
Posts: 392
Joined: Thu Apr 19, 2007 12:49 pm
Contact:

Post by adum »

congrats, tron :)
Post Reply