Problem 692

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
stackhg
Posts: 1
Joined: Fri Jul 17, 2020 8:00 pm

Problem 692

Post by stackhg »

I'd appreciate some clarification on Problem 692 (View Problem), Siegbert and Jo. The second rule of the game is: "In each of the following turns the current player must take at least one pebble and at most twice the amount of pebbles taken by the previous player."

So the current player may take from 1 to 2n stones, inclusive. But is n the number of pebbles taken by the previous player on the immediately preceding turn, or the total number of pebbles the previous player has taken over the course of the game?
User avatar
hk
Administrator
Posts: 12832
Joined: Sun Mar 26, 2006 10:34 am
Location: Haren, Netherlands

Re: Problem 692

Post by hk »

It is the number of pebbles taken by the previous player on the immediately preceding turn.
Image
War ruins the life and health of untold numbers of innocent children.
Post Reply