# Finding 2 poisoned bottles of wine out of a 1000

The problem is formulated here. And it is also discussed here (the chosen answer to which I don't understand). I've found a few other links on this site (e.g. this), but they don't provide any explicit procedure.

My question is: what is the testing procedure for hitting the lower bound of 43 servants/rats needed to discover two poisoned objects out of 1000?

-
Maybe if you wrote a detailed description of what you find confusing. I found Ori Gurel-Gurevich's answer at MO easy to understand and, up to constants, it's tight. –  Louis Jan 27 '12 at 17:16
@Louis I think the OP is interested in particular in optimal solutions. –  Listing Jan 27 '12 at 19:37
@Louis Yup, as Listing said, I'd appreciate a concrete, step-by-step construction for a test which can discover the two objects with only 43 rats. Furthermore, I'm not a mathematician (I'm a hobbyist) so Gurevich's answer doesn't make much sense to me at a purely mathematical level, but that's a different issue. I can at least follow a step-by-step procedure. –  JasonMond Jan 27 '12 at 20:07