The coins of various denominations are arranged in a chain (e.g., a row, a semicircle) with two "end points" and the others each having two neighbors.
A move consists in removing an end coin, whereby the coin's immediate (and the only) neighbor becomes naturally an end coin available for the removal on one of the successive moves.
The players take turns, 1st defined randomly.
When all the coins have been removed, the game ends, and the players count their bounties. The player with the larger amount wins.

Devise a winning strategy for one of the players.

No Solution Yet	Submitted by Ady TZIDON
Rating: 5.0000 (1 votes)

	Subject	Author	Date
	An even number of coins	Steve Herman	2015-11-28 19:42:34
	If you have a hammer, every problem looks like a nail	Steve Herman	2015-11-28 08:47:11
	re: 3 coins, 4 coins, and a question	Jer	2015-11-27 23:02:14
	3 coins, 4 coins, and a question	Steve Herman	2015-11-27 18:35:49
	Simple case	Jer	2015-11-27 16:19:13