Tag Archives: dynamic

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 applicable whenever we have some recursively … Continue reading

Posted in computation, games, recursion | Tagged , , , , , , , , , , , | Comments Off on Computing optimal play for the greedy coins game, part 4