Search Results for: Eggs not for incubation
x from to n q[ , x] := c( , x) for y from to n q[y, ] := infinity q[y, n + ] := infinity for y from to n for x from to n m := min(q[y- , x- ], q[y- , x], q[y- , x+ ]) q[y, x] := m + c(y, x) if m = q[y- , x- ] p[y, x] := else if m = q[y- , x] p[y, x] := else p[y, x] := now the rest is a simple matter
( t , n ) {\displaystyle f(t,n)} be the maximum number of values of m {\displaystyle m} that are distinguishable using t {\displaystyle t} tries and n {\displaystyle n} eggs. then f ( t , ) = f ( , n ) = {\displaystyle f(t, )=f( ,n)= } for all t , n ≥ {\displaystyle t,n\geq } . let a {\displaystyle...
https://en.wikipedia.org/wiki/Dynamic_programming