Tag Archives: optimal

Computing optimal play for the greedy coins game, part 4

Posted on May 12, 2017 by Brent

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

Computing optimal play for the greedy coins game, part 3

Posted on May 10, 2017 by Brent

In a previous post we saw how we can organize play sequences in the greedy coins game into a tree. Then in the last post, we saw how to work our way from the bottom of the tree upward and … Continue reading →

Posted in computation, games, recursion | Tagged , , , , , , , , , | 2 Comments

Computing optimal play for the greedy coins game, part 2

Posted on May 4, 2017 by Brent

I want to explain in more detail how we can think about computing the best possible score for Alice in the greedy coins game, assuming best play on the part of both players. I glossed over this too quickly in … Continue reading →

Posted in computation, games, recursion | Tagged , , , , , , , , , | 1 Comment

Computing optimal play for the greedy coins game

Posted on May 2, 2017 by Brent

Recall the greedy coins game, in which two players alternate removing one of the coins from either end of a row, and the player with the highest total at the end is the winner. What if we wanted to play … Continue reading →

Posted in computation, games, recursion | Tagged , , , , , , , , , | 2 Comments