Show that in the coins-in-a-line game,a greedy strategy of having the rst player, Alice, always choose the

Show that in the coins-in-a-line game,a greedy strategy of having the first player, Alice, always choose the available coin with highest value will not necessarily result in an optimal solution (or even a winning solution) for her. Show Greedy strategies don’t work by giving counter examples.

Answer rating: 100% (QA)

Consider there are 4 coins with following values 6 90 10 5 Now consider Alice being first player can ... View the full answer