Do these happen in this order or can they happen in any order? For example, if n=2, is (TAKE, TAKE, GIVE, GIVE) the only valid order of taking and giving allowed?B TAKEs n times and GIVEs n times after which the game finishes.
Problem 770
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.
See also the topics:
Don't post any spoilers
Comments, questions and clarifications about PE problems.
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
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.
-
_epistemologist
- Posts: 3
- Joined: Mon Aug 13, 2018 12:58 am
Problem 770
The problem states:
-
gaufowl
- Posts: 6
- Joined: Tue Sep 22, 2020 10:36 pm
- Location: MD,USA
Re: Problem 770
Any order is allowed and chosen by B, otherwise A would just choose 0,0,1,2 to end up with 4 gold at the end for n=2. Haven't solved the problem myself so if I'm wrong feel free to correct me, but that's my interpretation.
1691991_rIEOKCNEDBtm7EzRUeWtIZDvhFNxQVp1
-
neverforget
- Posts: 88
- Joined: Sat Sep 16, 2006 10:10 pm
Re: Problem 770
I don't really like the current wording of the problem. I would clarify that B can choose to TAKE if B has chosen TAKE (strictly) fewer than $n$ times previously, and similarly B can choose GIVE if B has chosen GIVE fewer than $n$ times previously. So this way you can see that B can always make a choice, but may sometimes have no choice as to which.
