Exercise: Rules of Nimble game: Nimble game is played on a game board consisting of a line of squares labelled: 0,1,2,3,.... A finite number of coins is placed on the squares with possibly more than one coin on a single square. A move consists in taking one of the coins and moving it to any square on the left, possibly moving over some of the coins and possibly onto a square already containing one or more coins. The player alternate moves and the game ends when all coins are on the square labelled 0. The last player to move wins.
Now i have to find winning move in this position with 6 coins: there is 1 coin on the squares 4,9,10,13 and 2 coins on the square 8.
i solve it as normal nim game (with heaps: 4,8,8,9,10,13) i get another solution that answers in ferguson (there is written for example to take coin from square 9 to square 0) and i dont understand why :( And there is also an error because there is also written to take coin from square 14 but there is no coins) or to take coin from square 10 to square 3. Can you explain why?