# Coin transport chain game

Suppose we have a line of 2013 banks that ends with a vault. The bank nearest to the vault has 1 sack of money, the bank second nearest has 2 sacks. The bank farthest away has 2013 sacks.

Jerry corporation and Meyer corporation are hired to take the sacks of money to the vault. In each turn a player can select a bank and take a positive integer number of sacks to the next bank (or directly to the vault if he chose the bank next to the vault). The winner is the company that makes the move that leaves all bags in the vault.

Which player has a winning strategy? Which is the strategy? Can we generalize to $n$ banks?

-
Why did you post this as math.stackexchange.com/questions/755036/… and then delete it and then post it again? – Gerry Myerson Apr 16 '14 at 13:45
Because yolo swag. No because I accidentaly typed it wrong the first time and that caused it not to get points. – The Kind Cat Apr 17 '14 at 0:14
So, why didn't you just edit it? – Gerry Myerson Apr 17 '14 at 1:24
I did, but it didn't receive attention. Now it did. – The Kind Cat Apr 17 '14 at 5:14
Shooting up a movie theater also receives attention. More justification is needed. – Gerry Myerson Apr 17 '14 at 12:04