ais523's puzzles

[ais523]

New puzzle: Encoding. dinasog
My solution: ficynut

[Werbad]

For Encoding (dinasog): dubevog
I'm not sure if compressing both crates into a base 11 number was the smartest choice, but it gave me an extra bit to work with.

[Rene]

For Encoding (dinasog): niluxig

Nice puzzle

[Twee]

It's a bit late, but here's mine for 1-up(hidypom): sylyduc.
edit: removed some vestigial parts from my solution.

[ais523]

New puzzle: zykyfox, "Speed Copy". Like one of my others, almost self-solving, but the crates are the wrong color. Can you copy them fast enough?

I haven't solved it yet (only just created it), but I suspect it's possible.

[Rene]

Speed Copy is certainly possible, but also pretty tough. I had an advantage because I had a solution to my own puzzle "Speed Floor Fluid Extreme" (dufocyn), which I could re-use. So, I cleaned and tuned the diesel engine from that solution, installed a second one, and presto: here is my speed boat solution

For Speed Copy (zykyfox): sykimaz

[ais523]

So here's a nice easy one, just because I'm amused it's possible: serefyd, Sequence in a Confined Space. I imagine most people's solutions to this will be pretty similar to mine, and each other.

[ais523]

And here's a rather harder one: segupop, No Timing Necessary.

My solution: mecydag

This one's sort-of an inversion of 1-Up. Instead of sending data upwards, you send it downwards. Instead of being able to send only crates, you can't send crates. And instead of requiring a solution based on timing… well, you'll see.

[jf]

For No Timing Necessary (segupop): xogugax

[curly]

For No Timing Necessary (segupop) : dyfegyp

[Rene]

For Sequence in a Confined Space (serefyd): dybipoh
For No Timing Necessary (segupop): bycelyb - Just because no timing is necessary, does not mean that it is not possible to use timing

And finally:
For 1-up (hidypom): dyhokag

[Werbad]

For No Timing Necessary (segupop): lixoreb

[jf]

For No Timing Necessary (segupop): lixoreb

That is really cool.

[ais523]

So it turns out, conveying 4 bits of information is easy just by counting dozers, as you can fit 16 dozers just fine. This allows for timing-based solutions where you cut off the stream of dozers at a given point.

However, what if you had to convey not 4 bits, but 12?

No Timing Necessary 2: kygusih

My solution: kuravys nupacoh (the previous version failed on the all-zeros case, I fixed it by adding one girder)

[Werbad]

For No Timing Necessary 2 (kygusih): gytysin