# Build a poisoned wine testing scheduler

Recently at Puzzling.SE, there was a problem that I wrote about determining which two bottles out of a larger number are poisoned when the poison only activates if both components are drunk. It ended up being quite the ordeal, with most people managing to get it down to 18 or 19 prisoners using completely different algorithms.

The original problem statement is as follows:

You are the ruler of a medieval kingdom who loves throwing parties. The courtier who tried to poison one of your wine bottles last time was furious to learn that you managed to identify which bottle he had poisoned out of 1,000 with just ten prisoners.

This time he's a bit craftier. He's developed a composite poison P: a binary liquid that's only deadly when two individually harmless components mix; this is similar to how epoxy works. He's sent you another crate of 1,000 wine bottles. One bottle has component C_a and another one has component C_b. (P = C_a + C_b)

Anyone who drinks both components will die on the stroke of midnight on the night they drank the final component, regardless of when in the day they imbibed the liquid. Each poison component stays in the body until the second component activates, so if you drink one component one day and another component the next, you will die on midnight at the end of the second day.

You have two days before your next party. What is the minimum number of prisoners you need to use for testing in order to identify which two bottles are tainted, and what algorithm do you need to follow with that number of prisoners?

Bonus
Additionally, suppose that you had a fixed limit of 20 prisoners at your disposal, what's the maximum number of bottles you could theoretically test and come to an accurate conclusion about which bottles were affected?

Your task is to build a program to solve the bonus problem. Given n prisoners, your program will devise a testing schedule that will be able to detect the two poisoned bottles among m bottles, where m is as large as possible.

Your program will initially take as input the number N, the number of prisoners. It will then output:

• M, the number of bottles you will attempt to test. These bottles will be labelled from 1 to M.

• N lines, containing the labels of the bottles each prisoner will drink.

Your program will then take as input which prisoners died on the first day, with the prisoner on the first line being 1, the next line being 2, etc. Then, it will output:

• N more lines, containing the labels of the bottles each prisoner will drink. Dead prisoners will have blank lines.

Your program will then take as input which prisoners died on the second day, and output two numbers, A and B, representing which two bottles your program thinks contains the poison.

An example input for two prisoners and four bottles might go as such, if bottles 1 and 3 are poisoned:

> 2      // INPUT: 2 prisoners
4        // OUTPUT: 4 bottles
1 2 3    // OUTPUT: prisoner 1 will drink 1, 2, 3
1 4      // OUTPUT: prisoner 2 will drink 1, 4
> 1      // INPUT: only the first prisoner died
// OUTPUT: prisoner 1 is dead, he can't drink any more bottles
3        // OUTPUT: prisoner 2 drinks bottle 3
> 2      // INPUT: prisoner 2 died
1 3      // OUTPUT: therefore, the poisoned bottles are 1 and 3.

The above algorithm may not actually work in all
cases; it's just an example of input and output.


Your program's testing schedule must successfully determine each possible pair of poisoned bottles in order for it to be a valid submission.

Your program will be scored on the following criteria, in order:

• The maximum number of bottles it can discern for the case N = 20.

• The number of bottles for the case N = 21, and successively higher cases after that.

• The length of code. (Shorter code wins.)

• How will the input look if more than one prisoner dies on a single day? Neither of your examples covers that case, and the specification is ambiguous to me. – ESultanik Jul 16 '15 at 11:34
• Is it a single line with a space-separated list of prisoners that died? – ESultanik Jul 16 '15 at 11:35
• Does shorter code matter more than number of bottles? Is it productive to increase the length of the code to make it handle one more bottle, as i did in my recent edit? – pppery Oct 12 '15 at 0:33
• Number of bottles takes priority. If you make your code longer and more complex to squeeze more bottles in, that is productive. – Joe Z. Oct 12 '15 at 5:26
• In the original problem there are only 2 days to solve the problem. Is that also the rule for the challenge? (it severly limits possible solutions, however an unlimited amount of days would be to easy) – LukStorms Nov 2 '15 at 22:43

# Python 2.7.9 — 21 bottles

Assuming that ESultanik's speculation is right on what the input is when multiple prisoners die

r=raw_input;s=str;j=s.join;p=int(r());z=range;q=z(p);x=z(p+1)
print s(p+1)+"\n"+j("\n",(j(" ",(s(a) for a in x if a!=b)) for b in q))
v=r().split();d=[s(a) for a in q if s(a) not in v];d+=[p]if len(d)==1 else [];
print "\n"*p,;r();print j(" ",[s(a) for a in d])


Algorithm: every prisoner drinks from every bottle except their number (1st prisoner doesn't drink first bottle). If they don't die, their number bottle is poisoned. If only one prisoner survives, the extra bottle is poisoned.

# Perl 5, 66 bottles

## (72 bottles for 21 prisoners)

The prisoners are divided optimally into 2 groups. The bottles are grouped in sets.

Each prisoner of group 1 will drink from all sets except for one. There will be 1 or 2 survivors. The 1 or 2 sets that weren't drank by them will continue to day 2.

On day 2 the remaining prisoners (including the survivors) drink from all remaining bottles except for one.
When 2 prisoners survive then the bottles they didn't drink are poisoned.
If only 1 prisoner remains then the bottle they all drank is also suspicious.

The code includes extra functionality to facilitate testing. When the poisened bottles are added as additional parameters, then it won't ask for input about who died.

($p,$f,$l)=@ARGV;$p=9if!$p;$m=$p-(2*int($p/4))+1;
$n=$p-$m+2;$b=$m*(($n+1)/2);
@M=(1..$m); print"Prisoners:$p\nBottles: $b\n"; # building the sets of items for$x(@M){
$j=$k+1;$k+=($n+1)/2;
$s=join",",($j..$k);$A[$x]=$s
}
# assigning the sets to the actors
for$x(@M){ @T=(); for$j(@M){if($x!=$j){push@T,split/,/,$A[$j]}}
print"Prisoner $x drinks @T\n";$B[$x]=join",",@T } if(!$f||!$l){ # manual input print"Who dies: ";$_=<STDIN>;chomp;
@D=split/ /;
%h=map{($_,1)}@D; @S=grep{!$h{$_}}(@M) } else{ # calculate who dies based on the parameters for$x(@M){
$d=0; map{if($_==$f||$_==$l){$d++}}split/,/,$B[$x];
if($d>1){push@D,$x}else{push@S,$x} } } for(@D){print"Prisoner$_ dies\n"}

# calculate the remaining items
for(@S){push@R,split/,/,$A[$_]}@R=sort{$a<=>$b}grep{!$g{$_}++}@R;

# different set of actors if there were 1 or 2 sets remaining
if(@S>1){@S=($S[0],$m+1..$p,$S[1],0)}else{@S=($m+1..$p)};

$i=0;@B=@D=(); # assign an item to each actor for$x(@S){
@T=();
for($j=0;$j<@R;$j++){ if($i!=$j){push@T,$R[$j]} }$i++;
print"Prisoner $x drinks @T\n"if$x>0;
$B[$x]=join",",@T
}

if(!$f||!$l){
# manual input
print"Who dies: ";
$_=<STDIN>;chomp; @D=sort split/ /; if(@D<@S-1){push@D,0} # because the set that noone drinks isn't manually put in %h=map{($_,1)}@D;
@L=grep{!$h{$_}}(@S);
}
else{
# calculate who dies based on the parameters
@D=();
for$x(@S){$d=0;
map{if($_==$f||$_==$l){$d++}}split/,/,$B[$x]; if($d>1){push@D,$x}else{push@L,$x}
}
}

for(@D){print"Prisoner $_ dies\n"if$_>0}

# calculate the remaining items
for(@L){push@F,split/,/,$B[$_]}
map{$c{$_}++}@F;
for(keys%c){push(@Z,$_)if$c{$_}==1} @R=sort{$a<=>$b}@Z; print"Suspected bottles: @R"  ## Test $ perl poisened_bottles.pl 20
Prisoners: 20
Bottles: 66
Prisoner 1 drinks 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 2 drinks 1 2 3 4 5 6 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 3 drinks 1 2 3 4 5 6 7 8 9 10 11 12 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 4 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 5 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 6 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 7 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 8 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 9 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 55 56 57 58 59 60 61 62 63 64 65 66
Prisoner 10 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 61 62 63 64 65 66
Prisoner 11 drinks 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60
Who dies: 2 3 4 5 6 7 8 9 10
Prisoner 2 dies
Prisoner 3 dies
Prisoner 4 dies
Prisoner 5 dies
Prisoner 6 dies
Prisoner 7 dies
Prisoner 8 dies
Prisoner 9 dies
Prisoner 10 dies
Prisoner 1 drinks 2 3 4 5 6 61 62 63 64 65 66
Prisoner 12 drinks 1 3 4 5 6 61 62 63 64 65 66
Prisoner 13 drinks 1 2 4 5 6 61 62 63 64 65 66
Prisoner 14 drinks 1 2 3 5 6 61 62 63 64 65 66
Prisoner 15 drinks 1 2 3 4 6 61 62 63 64 65 66
Prisoner 16 drinks 1 2 3 4 5 61 62 63 64 65 66
Prisoner 17 drinks 1 2 3 4 5 6 62 63 64 65 66
Prisoner 18 drinks 1 2 3 4 5 6 61 63 64 65 66
Prisoner 19 drinks 1 2 3 4 5 6 61 62 64 65 66
Prisoner 20 drinks 1 2 3 4 5 6 61 62 63 65 66
Prisoner 11 drinks 1 2 3 4 5 6 61 62 63 64 66
Who dies: 1 12 14 15 16 17 18 20 11
Prisoner 1 dies
Prisoner 11 dies
Prisoner 12 dies
Prisoner 14 dies
Prisoner 15 dies
Prisoner 16 dies
Prisoner 17 dies
Prisoner 18 dies
Prisoner 20 dies
Suspected bottles: 3 63


## Test without manual input

\$ perl poisened_bottles.pl 7 2 5
Prisoners: 7
Bottles: 12
Prisoner 1 drinks 3 4 5 6 7 8 9 10 11 12
Prisoner 2 drinks 1 2 5 6 7 8 9 10 11 12
Prisoner 3 drinks 1 2 3 4 7 8 9 10 11 12
Prisoner 4 drinks 1 2 3 4 5 6 9 10 11 12
Prisoner 5 drinks 1 2 3 4 5 6 7 8 11 12
Prisoner 6 drinks 1 2 3 4 5 6 7 8 9 10
Prisoner 2 dies
Prisoner 4 dies
Prisoner 5 dies
Prisoner 6 dies
Prisoner 1 drinks 2 5 6
Prisoner 7 drinks 1 5 6
Prisoner 3 drinks 1 2 6
Prisoner 1 dies
Suspected bottles: 2 5


# Python — 7 bottles

prisoners = int(raw_input())

bottles = 0
while (bottles * (bottles + 1) / 2 - 1) <= prisoners:
bottles += 1

print bottles

pairs = []
for i in range(bottles):
for j in range(i + 1, bottles):
pairs += [str(i + 1) + " " + str(j + 1)]

for i in range(prisoners):
if i < len(pairs):
print pairs[i]
else:
print

for i in range(prisoners):
print
raw_input() # discard the second day entirely


For allotments of at least n(n-1)/2 - 1 prisoners, you can do up to n bottles. For n = 7, this lower limit is 20.
We only actually need one day for this solution to work. A two-day solution with a similar scope might get up to 20 bottles for N = 20, but it's too much work for a trivial answer.