1
   

probably the hardest riddle ever

 
 
robdux
 
Reply Wed 7 Nov, 2007 01:27 am
You are working for Fort Knox, and are responsible for storing the gold in large safes. One day your boss walks up and has some bad news:
"Ok, someone screwed up. They delivered a package here that contains fake gold. The only way to recognize the package is by its weight, so you will have to weigh every package and see if it is lighter than the others. I already spoke with the folks at registry and narrowed it down to 512000 packets, which is still a lot I guess. You have time until tomorrow to find the quickest way to get the job done. I can get 4 scales from town, but every scale will only hold 1000 packages max. Also you won't be able to get the weight from these scales, but you will easily see the difference if the fake package is on one of these scales, of course only if all the scales have the exact same number of packages on them. I want you to find the way that needs the fewest scale attempts for the worst case scenario.
For every scaling you can put a stack of packages (not more than 1000 for every stack) on each of the four scales, and see the difference between those four stacks of packages. When you have the procedure please find the number of scale attempts needed for the best case and the worst case and report with the numbers to me tomorrow. I hope it is better than mine, because if not I may just fire you."....


number of scaling attempts for best case scenario ______
number of scaling attempts for worst case scenario ______
  • Topic Stats
  • Top Replies
  • Link to this Topic
Type: Discussion • Score: 1 • Views: 5,536 • Replies: 11
No top replies

 
Doowop
 
  1  
Reply Wed 7 Nov, 2007 02:24 am
number of scaling attempts for best case scenario ______ 2
number of scaling attempts for worst case scenario ______ 511119

Most efficient way of finding fake package, if all packages have to be checked _______ 137 (off the top of my head)


Best scenario takes pure chance into account, and means that you decide to weigh the packages in batches of three, placing one on each scale, starting with packages 1, 2, and 3, and just happen to pick up an imbalance on this very first (1)attempt, then trying (2) packages 2 & 3 on their own and finding them to be equal weight, so therefore it means that package 1 is the fake.

Worst scenario involves starting with weighing two packages at a time, each on a separate scale, (1) and then changing only one package per scaling (the remaining 511198 packages, meaning a further 511198 attempts) only to find that the very last remaining package is the fake, as it shows lighter than package 511999, which was of equal weight to all the others.
0 Replies
 
robdux
 
  1  
Reply Wed 7 Nov, 2007 03:09 pm
nope
nope i tried that and it didnt work...worst case scenario can only consist at max of a 5 digit number
0 Replies
 
Tryagain
 
  1  
Reply Wed 7 Nov, 2007 04:32 pm
Number of scaling attempts for best case scenario = 5
Number of scaling attempts for worst case scenario =133
0 Replies
 
markr
 
  1  
Reply Wed 7 Nov, 2007 10:38 pm
You get to define one procedure, then determine the best and worst cases for that procedure.

I get 6 and 133.

It can take from 1 to 128 scalings to get down to 1000 packages by weighing 4 different stacks of 1000 in each scaling.

From there, continue to divide the stack into fifths. Weigh 4 and keep 1 on the side. If the 4 balance, the fifth contains the bad package.

After 1 extra scaling, you've narrowed it to 200.
After 2 extra scalings, you've narrowed it to 40.
After 3 extra scalings, you've narrowed it to 8.
Now divide the stack in to quarters.
After 4 extra scalings, you've narrowed it to 2.
(Now add 2 known good packages if every scaling must contain 4 stacks.)
After 5 extra scalings, you've narrowed it to 1.

5 + 1 = 6
5 + 128 = 133
0 Replies
 
robdux
 
  1  
Reply Wed 7 Nov, 2007 10:44 pm
Congrats
Tryagain got it the answer was best case 5 worst case 133... ill have more soon
0 Replies
 
markr
 
  1  
Reply Wed 7 Nov, 2007 10:53 pm
How do you get it done in 5?

log5(1000) > 4 (log5 is log base 5)

So, if you start with 1000, it takes 5 scalings.
0 Replies
 
dadpad
 
  1  
Reply Wed 7 Nov, 2007 10:56 pm
markr wrote:
How do you get it done in 5?


Asked for help from mismi40.
0 Replies
 
markr
 
  1  
Reply Wed 7 Nov, 2007 11:00 pm
I just figured it out.

After narrowing it down to 8, weigh 4 stacks of 1 with a stack of 4 on the side. 50% of the time the bad package will be on a scale (only 4 extra scalings required). The other 50% of the time the bad package will be in the stack on the side, and it will take 1 more scaling.
0 Replies
 
Doowop
 
  1  
Reply Thu 8 Nov, 2007 02:25 am
Re: nope
robdux wrote:
...worst case scenario can only consist at max of a 5 digit number


Did I miss this 5 digit limit in the opening post?

I've just had another look and still can't see it.
0 Replies
 
Bohne
 
  1  
Reply Thu 8 Nov, 2007 08:02 am
Just of the top of my head I got
best: 6
worst 138
0 Replies
 
Bohne
 
  1  
Reply Thu 8 Nov, 2007 08:05 am
OK, I missed that the answer was given already!
0 Replies
 
 

Related Topics

Alternative Einstein's riddle answer - Discussion by cedor
Urgent !!! Puzzle / Riddle...Plz helpp - Question by zuzusheryl
Bottle - Question by Megha
"The World's Hardest Riddle" - Discussion by maxlovesmarie
Hard Riddle - Question by retsgned
Riddle Time - Question by Teddy Isaiah
riddle me this (easy) - Question by gree012
Riddle - Question by georgio7
Trick Question I think! - Question by sophocles
Answer my riddle - Question by DanDMan52
 
  1. Forums
  2. » probably the hardest riddle ever
Copyright © 2024 MadLab, LLC :: Terms of Service :: Privacy Policy :: Page generated in 0.04 seconds on 10/01/2024 at 10:23:48