So I came up with a variation of the famous problem https://www.reddit.com/r/math/comments/3o0mfi/a_king_1000_bottles_of_wine_10_prisoners_and_a/
n bottles, with each bottle independently having a probability
p_poison that it is poisoned, and for every instance of a test subject drinking from a poisoned bottle there is a probability
kill_chance that the poison takes effect after 24 hours.
The winning algorithm is the one that uses the least amount of test subjects (on average) to have a 75% or better chance to find at least one poisoned bottle (if any) in the 24 hour window.
Unless otherwise stated, all the rules and constraints from the original problem (as stated in the reddit link above) apply.
(Edited for clarity)