there are 1000 bottles and one is spoiled !!
NICE ! now our job is to detect the spoiled 1 with minimum
sips .... hmmmm think like sherlock holmes now !
probability of finding that one in 1000 is 1/1000
divide those 1000 into 4 parts 250 ,250, 250, 250
well well well now as i told only one is bitter means, it is
alkaline and it will turn a red litmus paper (ph paper) into
now collect a litmus paper from nearest store and start
dipping in first 250 bottles block !!
voila !! if it turned to blue , that one is the infected one
!! and u spotted it without even sipping :P
Take 500 of the bottles and put one drop from each of them into an empty bottle. Taste the juice in that bottle. If it's bitter, you know the poison is in one of them; if not, it's in one of the other 500. Now, take 250 of the bottles you've chosen and put one drop from each into another empty bottle and taste it. Now, you've narrowed it down to 250 bottles. Repeat, and narrow it down to 125... then 63... then 32... 16...8... 4... 2... and finally 1. And you only had to taste the juice 10 times, instead of possibly 999.
Alok and Bhanu play the following min-max game. Given the
N = X - Y - Z
where X, Y and Z are variables representing single digits (0
to 9), Alok would like to maximize N while Bhanu would like
to minimize it. Towards this end, Alok chooses a single
digit number and Bhanu substitutes this for a variable of
her choice (X, Y or Z). Alok then chooses the next value and
Bhanu, the variable to substitute the value. Finally Alok
proposes the value for the remaining variable. Assuming both
play to their optimal strategies, the value of N at the end
of the game would be