|
|
|
General Forum: Love | | PUZZLES PUZZLES AND PUZZLES | |
| alaa kaadu partha gaaru...he should distribute to all the servants on the first day tself......30 days aduthundi kadaa chaavadaaniki....
correct Ravi:)))
Posted by: Raj Sekhar At: 14, Jan 2004 7:53:55 AM IST
i got an idea to solve this
i got this idea from 2^10 ) 1000 with 10 servants this puzzle can be solved even if there are 1023 bottles .(wonderin who took the rest of 23 vodkaaas ;) ...Raj ..ooo Raj...unnavaa... :))
ok all of that if my way of solvin is correct
i will give an example with 3 servants
S1 - S2 - S3
--------------
0 -- 0 -- 1 bottle 1
0 -- 1 -- 0 bottle 2
0 -- 1 -- 1 bottle 3
1 -- 0 -- 0 bottle 4
1 -- 0 -- 1 bottle 5
1 -- 1 -- 0 bottle 6
1 -- 1 -- 1 bottle 7
-----------------------
representing using binary .. each servant will drink that bottles that has a one under his name. i.e., Servant 3 S3 will drink 1,3,5,7 (all odd) S2 - 2,3,6,7 S1 - 4,5,6,7
lets say bottle 3 has the poison S2,S3 will die and S1 wont which gives us 1 0 0 = 3
sure this works for all 10 servants in the same way ... :)
Posted by: Ravi At: 14, Jan 2004 2:46:10 AM IST
Hi Sekhar.
Need some clarification...
- Is there a condition that he should distribute just one bottle a day and also that the servants drink just one bottle a day?
- you said vodka and wine..hope you meant the same drink :-)
- "the king identifies the bottle in 30 days" means it is possible that somebody would be already dead by then
Posted by: Hytech At: 13, Jan 2004 11:21:14 PM IST
okk...one from me tooo.....
A King has ten servants and 1000 bottles of vodka to distribute among them. One of the bottles contains poison, which if taken, results in death in 30 days. How should the king distribute the wine so that he identifies the poisoned bottle in exactly 30 days.
Posted by: Raj Sekhar At: 13, Jan 2004 10:31:17 PM IST
wowww........nice one ravi......
nenu second step tharuvaatha 3down 1 up or 1 up thre down vacchina tharuvatha.....
inka probability meeda depend ayi untundi anukoni aalochinchadame maanesaanu...very nic solution............good one keep it up........:)))))))))
Posted by: Raj Sekhar At: 13, Jan 2004 10:07:09 PM IST
ok here is the answer ...
Let’s try to achieve face up for all cups (but face down can win too :D)
1: Take both cups on one edge, and turn them both face-up (one or both if face down or none if neither). If we don't win, we know that one or both of the others is still face-down.
(spin)
so we have
U U
D U
Or
U U
D D
2: Take two cups on one edge. If they're both face-down, then we can win immediately by turning them both face-up.
If they're both face-up, then turn them both face-down. Either this will win, or we know that the other two are one of each: If the other two were both up, we would have won last round, and if they're both down, we win this round. Either way, we know that we now have three down and one up.
(spin)
So we have
D D
D U
3: Take two cups across a diagonal from each other. If one is up, we know that that's the only "up" on the table, so we just turn it down and win. If they're both down, we flip one of them up at random. Now, we have
UU
DD
or some rotation of that.
(spin)
4: Take two cups on one edge, and flip them both. If they were both the same, then we just matched them to the other pair and won. If they were different, then we've created
UD
DU
or a rotation of that.
(spin)
5: Take two cups on a diagonal, and flip them both. We've just matched them to the other diagonal pair and won.
This looks like the best 5 steps I could get to ensure all face down or face up.
Posted by: Ravi At: 13, Jan 2004 9:49:10 PM IST
yup u r right ..partha ..:)
Posted by: Ravi At: 13, Jan 2004 8:17:50 AM IST
Sorry, 5 moves Ravi got it now!
Posted by: Hytech At: 13, Jan 2004 7:09:11 AM IST
:) i got the solution too :)
i am just waiting for my friends reply ..:)
i am sure this onez correct
Posted by: Ravi At: 13, Jan 2004 6:25:38 AM IST
I think its possible with 4 moves max! :-)
Ravi I can send you the solution and see if its correct!
Posted by: Hytech At: 13, Jan 2004 5:48:04 AM IST
| |
|
|
|
| Advertisements |
|
|
|
|
| Advertisements |
|
