Problem 409

A place to air possible concerns or difficulties in understanding ProjectEuler problems. This forum is not meant to publish solutions. This forum is NOT meant to discuss solution methods or giving hints how a problem can be solved.
Forum rules
As your posts will be visible to the general public you are requested to be thoughtful in not posting anything that might explicitly give away how to solve a particular problem.

This forum is NOT meant to discuss solution methods for a problem.

In particular don't post any code fragments or results.

Don't start begging others to give partial answers to problems

Don't ask for hints how to solve a problem

Don't start a new topic for a problem if there already exists one


See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
Post Reply
thundre
Posts: 356
Joined: Sun Mar 27, 2011 10:01 am

Problem 409

Post by thundre »

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.)
Image
Top
ffff0
Posts: 50
Joined: Sun Aug 21, 2011 6:26 am
Location: Moscow, Russian Federation

Re: Problem 409

Post by ffff0 »

Yeap, they are different.
Image
Top
chaotic_iak
Posts: 2
Joined: Wed Dec 15, 2010 7:19 am

Re: Problem 409

Post by chaotic_iak »

I also suppose that a player wins if he takes the last stone (normal play, not misere play)?
Top
User avatar
Marcus_Andrews
Administrator
Posts: 1637
Joined: Wed Nov 09, 2011 5:23 pm

Re: Problem 409

Post by Marcus_Andrews »

chaotic_iak wrote:I also suppose that a player wins if he takes the last stone (normal play, not misere play)?
That's right.
Top
Post Reply

Return to “Clarifications on Project Euler Problems”