mathlesstraveled.com
Computing optimal play for the greedy coins game, part 4
Last time I explained a method for computing best play for instances of the greedy coins game, which is feasible even for large games. This general approach is known as dynamic programming and is a…