| Comments
(turn spoilers off) |
 |
| 4099 |
Not Quite DNF |
John Lewis (411) |
Sun 28 Aug 2005 21:32 |
SPOILER |
| |
Added speedrun: 272 moves (old: 274). |
| |
| 2629 |
Not Quite DNF |
Tom 7 (1) |
Sat 21 May 2005 14:28 |
SPOILER |
| |
Added speedrun: 274 moves (old: 999999). |
| |
| 432 |
Not Quite DNF |
Tom 7 (1) |
Sat 26 Feb 2005 11:57 |
SPOILER |
| |
Cook: I'll make a level to illustrate. ;) |
| |
| 425 |
Not Quite DNF |
bpotetz (144) |
Fri 25 Feb 2005 15:12 |
SPOILER |
| |
NP-complete fo shore.
Just not as popular at parties. |
| |
| 424 |
Not Quite DNF |
Tom 7 (1) |
Fri 25 Feb 2005 15:05 |
SPOILER |
| |
I dunno about that, I bet ternary parity-normal-form is NP-complete... |
| |
| 423 |
Not Quite DNF |
bpotetz (144) |
Fri 25 Feb 2005 13:23 |
|
| |
Tom's DNF embedding was pretty cool, but not too hard, in spite of being np-complete. This puzzle doesn't map to any neat CS problem, but it might take you longer to solve.
Of course, you only have 243 choices, so it shouldn't be too tough. |
| |
