this 1 plz http://trickiestofall.blogspot.com/2011/06/poisoned-wine-puzzle.html

Question

amistre64 · Answer

:)  ive developed an immunity to iocane powder

anonymous · Answer

I have seen this before

anonymous · Answer

very similar one

anonymous · Answer

it has something to do with binary counting from memory

anonymous · Answer

http://www.facebook.com/#!/photo.php?fbid=154206761311413&set=a.154206757978080.42564.124257367639686&type=1&theater

anonymous · Answer

so you have 1000 bottles , so all need to do is find the smallest power of 2 that is greater than 1000

anonymous · Answer

2^n >1000

solve that for n , and n is the number of prisoners

anonymous · Answer

n=10

anonymous · Answer

basically , each bottle can be represented by a binary number, a string of 0's and 1's

anonymous · Answer

and to get 1000 different binary codes you need 10bits

anonymous · Answer

the first prisoner drinks from all the bottles ( and takes care of the first bit ) , the second drinks from all and takes care of the second bit of the code etc