Tag Archives: dynamic programming

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