Find the probability that the p^{th} player will win a single-elimination tournament with 2^n players where M(i,j)=probability that player i will beat player j in a head-to-head matchup. In the first round player 1 plays player 2, player 3 plays player 4 and so on. (In each round each surviving competitor plays his surviving "next door neighbor" in the bracket.)
See also problem 2254.
Trivial example :
if
M = [ NaN 0.7 ; 0.3 NaN ]
then
winprob(M,1)=0.7
and
winprob(M,2)=0.3
Could you make your test cases consistent on using either 0 or NaN on the diagonal?
OK, I made it consistently use NaN.
927 Solvers
14975 Solvers
44 Solvers
65 Solvers
Greed is good - Simple partition P[n].
22 Solvers