Skip to main content
8 events
when toggle format what by license comment
Oct 17, 2014 at 20:32 history edited COTO CC BY-SA 3.0
added 10 characters in body
Oct 17, 2014 at 20:30 comment added COTO @nneonneo: Lousy efficient SAT solvers. >___< But props for transforming the problem and making use of the tools available out there. I'll award the 100 rep to one of your answers ASAP, which is about 19 hours.
Oct 17, 2014 at 20:29 comment added CSᵠ dude, you're insane, this RegExp has 122 alternations, 40 of which are negative lookaheads, WTG++
Oct 17, 2014 at 20:24 comment added TwiN PLEASE! DON'T! BE! SO! QUICK!
Oct 17, 2014 at 19:57 comment added nneonneo I'm actually rather amazed at how efficient minisat is; it took just 30 seconds to solve the problem. I started with a bruteforce approach which didn't pan out, and decided to just go with a straight SAT-solver approach (using Tseitin transformation to encode the positive constraints).
Oct 17, 2014 at 19:56 comment added nneonneo Match: ThatWasActuallyFun. Non-match: ,,;,;,,;,;;;,;,;,;;,,,,;,,,;,;;,,,,,,;;,,,,;;,;,,,;,;;;;,;;,;;,;,,;,,;,;;;,;,;,;;,,,;,;;;;,;,;;;,;,,;,,,;,,,,;,;;;;;;,,,,,;,;,;;;;;,;;;,;;,,,;;;,,;,;;,,,;,,,,,,;,;,,;;,,;;,,,;,;;,,,;,,;;,;,;,;;;;,,;,;,,;;;;;,,;,,;;,,;,,;;,,,,;,,;,,;;,;;;,,,,,;,,,,,,,,;,,,,.
Oct 17, 2014 at 17:08 comment added Unihedron Challenge accepted...
Oct 17, 2014 at 15:26 history answered COTO CC BY-SA 3.0