« back Browsing Levels: #363 "True or False?" | |
prev: #362 "Memoryless Hole (v3)" | next: #364 "Treehouse (v2)" |
"True or False?" by Tom 7 and William |
|
|
Comments (turn spoilers off) | ||||
3907 | True or False? | John Lewis (411) | Sat 13 Aug 2005 20:48 | SPOILER |
Added speedrun: 362 moves (old: 440). More pointless speedrunning... |
||||
2630 | True or False? | Tom 7 (1) | Sat 21 May 2005 14:28 | SPOILER |
Added speedrun: 440 moves (old: 999999). | ||||
537 | True or False? | Tom 7 (1) | Mon 07 Mar 2005 09:04 | SPOILER |
Thanerik: The updated versions of this level are much better. =) The "deleted" directory sucks! | ||||
536 | True or False? | Thanerik (331) | Mon 07 Mar 2005 07:47 | SPOILER |
Cook: It can be sloved on many ways - and it only need one green sephre to open... it will be better if it need ALL greens to open | ||||
386 | True or False? | Tom 7 (1) | Wed 23 Feb 2005 15:09 | |
Deleted 'cos of Brian's cook. New version will be released when STEEL tiles are released! | ||||
384 | True or False? | Tom 7 (1) | Tue 22 Feb 2005 18:40 | SPOILER |
Right, it is not totally rigid in that sense. But sat problems with only one solution are often easier than ones that are less constrained. | ||||
382 | True or False? | bpotetz (144) | Tue 22 Feb 2005 16:42 | SPOILER |
Oh. That's interesting. You know, even if both rows and columns could not be partially pushed, there would still be several solutions. And I think it would still map to a satisfiability problem. Anyway, looking forward to some cool new tiles! |
||||
381 | True or False? | Tom 7 (1) | Tue 22 Feb 2005 16:23 | SPOILER |
I mean two or four pushed all the way down. In my solution, in fact, if I pushed the columns all the way down, I would reset one of the tiles blocking the exit. | ||||
378 | True or False? | bpotetz (144) | Tue 22 Feb 2005 15:01 | SPOILER |
Two or four green spheres is also OK in a column, because there is nothing that forces you to push the entire column down. I just stop pushing after I get one in. | ||||
376 | True or False? | Tom 7 (1) | Tue 22 Feb 2005 11:13 | SPOILER |
So you're only supposed to need one green sphere (and definitely not two or four ;)) in each clause (column). That's not a cook, that's just my bad description. You're right about shifting 'both left and right.' Duh. Fortunately, this new tile I'm working on solves that problem nicely! |
||||
375 | True or False? | Tom 7 (1) | Tue 22 Feb 2005 11:09 | |
Oops, sorry, this is supposed to be Disjunctive Normal Form, not Conjunctive. | ||||
367 | True or False? | bpotetz (144) | Tue 22 Feb 2005 01:17 | SPOILER |
Cook: Cool idea, guys. I like levels based on abstract concepts, esp cool np-complete ones like satisfiability. Unfortunately, there's a couple ways to cook this one. The easiest is to just ensure that there is some non-zero number of green sphere in each column, and stop pushing them down one you get one in. You could stop this by installing a grey sphere at the bottom of each column that can only be moved down, onto a panel that locks the player into the column until they push down a second grey sphere (from the top of the column) that unlocks them. The other potential cook is that rows don't have ot be ternary - you can shift one partially in either direction. But that could be intentional. Anyway, I count 4 ternary solutions (and no binary solutions). |
||||
363 | True or False? | Tom 7 (1) | Mon 21 Feb 2005 18:40 | SPOILER |
Here's another encoding of n-SAT in CNF. Aside from the crap having to due with blocking in the columns after you select assignments, this is a pretty dense encoding. Note the innovative use of breakable blocks for decorative effect, due to William. |
||||