Project Euler Forum

For n=2, there are 2 piles of size 1..3. That gives (3 choose 2)=3 possibilities. How could W(2)=6?

Unless positions with the same pile numbers in different orders are considered distinct. (I think I just answered my own question.)

Yeap, they are different.

I also suppose that a player wins if he takes the last stone (normal play, not misere play)?

chaotic_iak wrote:I also suppose that a player wins if he takes the last stone (normal play, not misere play)?

That's right.