Werbad's Puzzles

[Werbad]

That's a very nice solution jf!

I have currently found 2 different ways for solving Zero Point: gozanuz and kogupog
The first solution is what I first intended, but I couldn't find any good way of preventing the second way...

[jf]

That's a very nice solution jf!

I have currently found 2 different ways for solving Zero Point: gozanuz and kogupog
The first solution is what I first intended, but I couldn't find any good way of preventing the second way...

Here is a solution for Zero Point: gudybag. It's along the same lines as kogupog. I was trying a gozanuz-style solution when I impatiently switched to gudybag, and then looked at your solutions--so I won't be attempting the gozanuz-style solution now. 

[Werbad]

I would say that gudybag uses a different approach than kogupog to get a 0 crate.
gozanuz uses ? + ? = 0
kogupog uses ? ^ 2 ^ 2 ^ 2 ^ 2 = 0
gudybag uses ? * 16 = 0

Which means that we currently have 3 different solutions for the level.

[immibis]

For Zero Point (tozefif): dizulog, and begozig

[Timbo]

For Zero Point(tozefif): dehyhox(15 ticks)
It uses a little bit Fibonacci: ?+?+?+2?+3?+5?+3?=0

[Werbad]

7 ticks: bubyzug
A gozanuz style solution, might be possible to do even faster.

[jf]

For Break (visaguz): hubytig

That was a very tough one, and it's very difficult to test.

My design: I drop a repeating stream of F to 0 on the "moving" value, with a space between the F and the following 0. This gives a leftward burst of barrels leading with the matching value, and with the space, this works even if the moving value is F (without the space you would see just a continuous stream). I then trim all but the first value of each burst -- this identifies the current moving value. I watch the trigger, and each time it fires, I edit out a little bit of the "timeline" on both the left and right of the identification barrel stream.

The edit is needed because when the moving value shifts, you can get a misread depending on where in the sequence it appears--for example, if the value becomes F, then any dropping barrel will start a new burst, which is a misread if it's not F. I have to edit on the left because I can't get the barrels up and over to the match test fast enough--editing out to the left is going back in time. Otherwise, it the moving value changes too quickly, I won't have time to catch it down on the bottom once the match is made.

The match is a simple "subtract and it should be zero" test. When it matches, I open the catch valve.

It's possible I made a mistake on the time window for editing. Switching the increment value from 4 to 2 increases the edit window. I lost patience counting ticks.

One of the hardest pieces to get working is the time editor, which has to keep the erase head operating for a constant time from the last trigger, which means, a constant stream of triggers has to keep the erase head erasing, and it can't stop erasing until the constant time from the very last trigger.

Due to the constantly looping test stream, it's possible to catch the value within a very short time, when by chance the stream just happens to cross the value and start a burst when the erase head is not erasing, so, a full drop of sixteen barrels is not necessary on any given moving crate.

[Werbad]

Nice work! It seems a little more complicated than my solution, looking at the explanation that is...

My solution: kelibyp

In my solution I repeatedly drop x and x+1 onto the moving matcher with a 10 tick interval, where x is the target value. If the first barrel goes left it will move to the top of the device and will, if no break signal is received, unlock the target. If the second barrel goes left it will manually trigger a break signal thus invalidating the first barrel. Since the 'F' case doesn't have a x+1 value this barrel is simply not included. I reset the break switch every 10th tick, just after the first barrel has passed

Edit:
Made a faster version of my previous solution: tumahyk
It shouldn't be possible to check the crates any faster than this.

This time I throw a constant flow of x and x+1 onto the matcher. This gives a 4 tick cycle compared to my 10 tick cycle in my previous solution. If x goes left it will position itself into the row of crates at the top. If x+1 goes left it will temporarily remove one crate from the row. Since the check is so fast, the only time I need to break the operation is if the check crate changed in between the two checks. Every fourth tick a dozer will push the row of crates, and if it is complete it will unlock the target.

Timing is the key!


New puzzle:
Fire Escape sobexeg

[Werbad]

New Puzzle:
Make me some C0FFEE: tabivex

[Rene]

For Break (visaguz): sudebek

I managed to test on both x and x+1 within the 2 ticks that the moving crate is showing. This enables me to ignore the "new crate" key, which means I do not need to bother with reseting the machine. The machine correctly matches even if the correct crate is within a stream of other crates (try setting the 'D' to '0' instead). The hardest part was to get the exception 'F' to work.

[jf]

For Break (visaguz): sudebek

I managed to test on both x and x+1 within the 2 ticks that the moving crate is showing. This enables me to ignore the "new crate" key, which means I do not need to bother with reseting the machine. The machine correctly matches even if the correct crate is within a stream of other crates (try setting the 'D' to '0' instead). The hardest part was to get the exception 'F' to work.

I am intrigued -- I will find time to attempt a similar solution based on the spoiler alone, before looking at the solution.

On another note, for Fire Escape (sobexeg): dekomag

[Werbad]

If I'd known that was possible I wouldn't have added the break key... Nice work Rene.

And for Fire Escape: tupaled

[Rene]

If I'd known that was possible I wouldn't have added the break key... Nice work Rene.

Thanks. I am actually most pleased with the simply way I found to detect a single barrel coming out of the detector, but ignore 2 in a row.

For Fire Escape (sobexeg): sagulag
For Coffee (tabivex): zucahug

I used a computer program to compute the correct sequence, and then implemented an automata for the solution.

[jnz]

For Make me some C0FFEE (tabivex): mygahul
Like Rene, I also used a program to find an input sequence

[Werbad]

Nice work for C0FFEE, I seem to have lost my solution though...
I really like jnz solution, makes it seem so easy.