Author
|
Topic: Werbad's Puzzles (Read 74820 times)
|
|
Werbad
|
New Puzzle: Uneven Multiplication ganexodWhat the machine does: The machine will output a series of random crates multiplied by a fixed, odd number. The first crate out is the one 'matching' the target crate.Hint: 0 and 1 is not included in the stream of random crates, so try to figure out these values to find the multiplier.
|
|
|
|
|
Logged
|
|
|
|
|
Bucky
|
partial solution to Uneven( ganexod): nygobux. It produces the barrel which you need to multiply the first crate by.
|
|
|
|
« Last Edit: January 02, 2009, 04:14:48 PM by Bucky »
|
Logged
|
That is the most ingenious method of solving an impossible puzzle that I have ever seen.
|
|
|
|
Werbad
|
You do realize that barrel gets randomly picked every time, right? There's a random delay before the machine starts working to prevent timed solutions.
|
|
|
|
|
Logged
|
|
|
|
|
|
|
Rene
|
For Uneven Multiplication ( ganexod): dabilubEdit: I used the same principle as JF
|
|
|
|
« Last Edit: January 06, 2009, 10:45:31 PM by Rene »
|
Logged
|
|
|
|
|
Werbad
|
I used a slightly different method to get the target crate. After finding out the multiplier I create all possible multiples and extract the index of the one that matches the first outputMy solution: pykitis
|
|
|
|
|
Logged
|
|
|
|
|
Rene
|
I used a slightly different method to get the target crate. After finding out the multiplier I create all possible multiples and extract the index of the one that matches the first outputMy solution: pykitisFunny mechanism you have at the bottom, with the cycling list of values. That must be usable for more purposes... BTW, you solution fails when the target crate is 'F' (which happened the first two times I run your machine, talk about Murphy). It then produces a '7' instead of 'F'. Not sure why.
|
|
|
|
|
Logged
|
|
|
|
|
Werbad
|
Hmm it's probably the 8- part that's wrong. I did some last minute optimizations, removing all even numbers from the cycle, and that seems to have messed it up. Original solution: fomygetEdit: I just noticed that your solution fails if the target crate is 1. It's really easy to fix though, just don't let the first crate pass through the multiplier checking system
|
|
|
|
« Last Edit: January 07, 2009, 08:32:13 PM by Werbad »
|
Logged
|
|
|
|
|
Rene
|
Hmm it's probably the 8- part that's wrong. I did some last minute optimizations, removing all even numbers from the cycle, and that seems to have messed it up. Original solution: fomygetCorrect. The '8' should be '0' instead (all numbers add up to 8, modulo 16, but the uneven numbers on their own add up to 0). Strange that it did work for other targets, though. Edit: I just noticed that your solution fails if the target crate is 1. It's really easy to fix though, just don't let the first crate pass through the multiplier checking systemMmm, did not think of that. You're correct of course. Here is my solution for Pitfall ( kasykug): manusupAnd for Underflow Protection 2 ( muzidim): hidomozAnd Underflow Protection 3 ( morezyh): dadatar
|
|
|
|
« Last Edit: January 08, 2009, 01:39:07 AM by Rene »
|
Logged
|
|
|
|
|
jf
|
Very stylish solutions, Rene. They have inspired me to simplify my solution to 4-bit Difference. For 4-bit Difference gafylid: xagoxat
|
|
|
|
|
Logged
|
|
|
|
|
Werbad
|
Nice one. I'm pretty sure I never posted my solution for that one: gedybem
|
|
|
|
|
Logged
|
|
|
|
|
Rene
|
Very stylish solutions, Rene. They have inspired me to simplify my solution to 4-bit Difference.
Thanks. I am especially proud of hidomoz. It took surprisingly long to construct, though. As I did not solve 4-bit Difference yet, I had a go at that one as well. That's a very hard puzzle! For 4-bit Difference ( gafylid): jepanot I tried with a look-up table first, but did not get that to work. Then I found this pattern that allowed a solution without look-up table.
|
|
|
|
|
Logged
|
|
|
|
|
|
|
Rene
|
Ough. That is going to be a tough one... But I managed ! This has really been my cross for the past week. The solution is an intricate timing exercize. It is a bit slow, but gets the job done! The slowest is probably combination 2355 (read from bottom to top), which happens to be solved in 5233 ticks, peculiar enough. But it was fun; I learned a number of new tricks on the way, which is surprising after the number of puzzles I have already done. For Match Maker ( gamogyr): hydehyzThis must have the largest number of ways to block/unblock a pipe in a single solution:  - a normal dozer draw
- a 2-tick fibrating barrel
- a door key triggered by a barrel
- a door key triggered by a dozer
- with the passing dozer
- with a passing barrel
- with a stationary barrel removed by an adder
I am looking forward to seeing Werbads solution 
|
|
|
|
« Last Edit: January 17, 2009, 05:17:56 PM by Rene »
|
Logged
|
|
|
|
|
Werbad
|
Actually, I just solved it myself just now. When I posted the level I had just confirmed it was possible, and hadn't started any solution yet. It took a while, but here's my solution: zaxotobWe seem to use the same basic idea for creating the target crates, but I reused my cycler device to check the crates. The only thing I'm worried about is that the solution might not work in all cases since I skip the 0-crate. If it doesn't I'll have to use a completely different approach... Edit: New Puzzle: Timelimit hacuzotEdit: And Another: Controller sokixep dodenaf (I have no solution for this one yet)
|
|
|
|
« Last Edit: January 25, 2009, 12:51:39 PM by Werbad »
|
Logged
|
|
|
|
|
 |