|
Pages: 1 [2] 3 4
|
 |
|
Author
|
Topic: Timbo's puzzle (Read 8622 times)
|
|
|
|
jf
|
|
|
|
|
« Last Edit: June 11, 2007, 07:11:47 PM by jf »
|
Logged
|
|
|
|
|
|
|
Timbo
|
I didn't thought sombody would create a new solution for More Binary, I thought everybody would use their old solution with barrels and put something to make a crate out of the barrel to the end, something like dakokasNew Puzzles One Bit I: fygicyrOne Bit II: magocanOne Bit III: pybakemThey are solveable, but the solution isn't always short. My solution for One Bit III needs im worst case 9k Frames
|
|
|
|
« Last Edit: June 12, 2007, 08:51:06 AM by Timbo »
|
Logged
|
|
|
|
|
|
|
jf
|
|
|
|
|
« Last Edit: June 13, 2007, 09:16:51 AM by jf »
|
Logged
|
|
|
|
|
jf
|
For One Bit I fygicyr: felireh. For One Bit II magocan: novidac. The worst-case time to solve is 247 ticks, which I challenge others to beat. The winch carries two bits of information along with signaling the elapsed time, letting me cut the worst-case time by a factor of 4.
|
|
|
|
« Last Edit: June 14, 2007, 09:41:52 PM by jf »
|
Logged
|
|
|
|
|
Timbo
|
challenge accepted: One Bit II: lavisux worst case: 167 ticks
|
|
|
|
|
Logged
|
|
|
|
|
Rene
|
challenge accepted: One Bit II: lavisux worst case: 167 ticks Superbly well done, Timbo! I had a very hard time achieving a better score. I especially like your full speed counter  . For One Bit II ([level][/level]): zokimar (worst case: 158 ticks)
|
|
|
|
|
Logged
|
|
|
|
|
Timbo
|
Some optimizations later my solution needs 157 ticks worst case: hidybebEdit: And even faster: dyfaxyr 154 ticks worst case.
|
|
|
|
« Last Edit: June 19, 2007, 09:03:46 AM by Timbo »
|
Logged
|
|
|
|
|
Rene
|
Some optimizations later my solution needs 157 ticks worst case: hidybebEdit: And even faster: dyfaxyr 154 ticks worst case. I could not let that go unchallenged  : perezav -- worst case 151 ticks It's really down to counting ticks now. And zaxifeh -- worst case 147 ticks. I have used Timbo's full-speed counter now. There is still some room for improvement, but I couldn't get the initialization fast enough. Maybe I have a look at it later.
|
|
|
|
« Last Edit: June 30, 2007, 07:31:44 PM by Rene »
|
Logged
|
|
|
|
|
Timbo
|
I don't think I can speed up my machine to be as fast as zaxifehThat's why I have looked at Rene's initialization and improved it: picyguk Worst case 144 ticks I had to replace most of the lower part. p.s. zaxifeh doesn't solve the problem for 3 0, but that is easily corrected
|
|
|
|
|
Logged
|
|
|
|
|
Rene
|
Well done, Timbo. You improved exactly those points that I had problems with: synching the even and odd counters at startup, the initialization down-pipe for the '1', and the 'D' comparison at the bottom. Nice small solutions for the top, and an inventive one for the bottom. It is surprising how close we got to the theoretical limit of 128 ticks.
|
|
|
|
|
Logged
|
|
|
|
|
adept
|
Been out of town and computer crashed. Anyway- here is a solution to binary: ginegacI took all my math before binary and hex were taught much so looking at the other solutions is teaching me a lot
|
|
|
|
|
Logged
|
|
|
|
|
|
|
|
Pages: 1 [2] 3 4
|
|
|
 |