Author
|
Topic: Sly's Puzzles (Read 38629 times)
|
|
|
|
krisper
|
I saw jf's solution for Rubiks Rectangle and thought the puzzle would be to difficult for me... until I looked a little closer. Rubiks Rectangle ( xycusud): gyborof
|
|
|
|
|
Logged
|
|
|
|
|
sly
|
|
|
|
|
|
Logged
|
Okay, think of a number. Now, scratch that number and think of 0. You're thinking of zero, right? FrEaKy
|
|
|
|
sly
|
NEW PUZZLE Basic Lingual Differences: kemakic
|
|
|
|
|
Logged
|
Okay, think of a number. Now, scratch that number and think of 0. You're thinking of zero, right? FrEaKy
|
|
|
|
Werbad
|
Not always possible unless you add another Crate...
|
|
|
|
|
Logged
|
|
|
|
|
sly
|
You're right. The new one is dyzadud
|
|
|
|
|
Logged
|
Okay, think of a number. Now, scratch that number and think of 0. You're thinking of zero, right? FrEaKy
|
|
|
|
Rene
|
For Basic Lingual Differences ( dyzadud): kyzygumI used a construct that I came up with long time ago for a similar puzzle
|
|
|
|
|
Logged
|
|
|
|
|
sly
|
Basic Lingual Differences 2: tozabek
|
|
|
|
|
Logged
|
Okay, think of a number. Now, scratch that number and think of 0. You're thinking of zero, right? FrEaKy
|
|
|
|
|
|
Timbo
|
Without looking on Werbads solution I have one on the same principle( Inserting zeros the whole time). Here it is: For Basic Lingual Differences 2 ( tozabek): mukoloc(91 ticks) I even understand why it works. It is based on the fact, that triangular number have a period of 32 and in this period every number exists 2 times. Therby after 32 crates the door sticks out at 2*solution moments
|
|
|
|
|
Logged
|
|
|
|
|
Rene
|
For Basic Langual Differences 2 ( tozabek): dyxyneb (87 ticks) Using the same principle as Werbad and Timbo
|
|
|
|
|
Logged
|
|
|
|
|
sly
|
I'm impressed! That's very clever. anyway here Basic Lingual Differences 3: gizybog
|
|
|
|
|
Logged
|
Okay, think of a number. Now, scratch that number and think of 0. You're thinking of zero, right? FrEaKy
|
|
|
|
Werbad
|
For Basic Lingual Differences 3 ( gizybog): davygup The solution is divided into 2 sections each checking 2 different methods of retrieving the crate value. The right section looks for F's. The barrel after an F is always equal to the target crate. This information however isn't always enough since some cases never generate F's, therefore I also made the left section. The left section looks through the first 8 barrels to find the most common value. The only time this system might fail is on case E, which will always be handled by the Right system.Edit: Just noticed that it fails in some rare cases New solution: fehegub I noticed a new pattern in my old solution; Every second output is the target and the rest is one of: 1, 3, 7, or F. Not always, but at least once per 8 outputs. This new machine simply looks for 1's, 3's, 7's, and F's and the next output will be the target. Solves a lot faster than the old one.
|
|
|
|
« Last Edit: April 23, 2008, 01:39:55 PM by Werbad »
|
Logged
|
|
|
|
|
|
|
Werbad
|
Ok, I was trying way too hard... I feel stupid for not noticing this simple pattern. Using the output from my earlier solutions, the target crate is always equal to the lowest of 2 following barrels.For Basic Lingual Differences 3 ( gizybog): bogygyc
|
|
|
|
|
Logged
|
|
|
|
|
 |