There are 21 sticks. Two players, A and B, alternate turns. Ineach turn, a playe

Question

There are 21 sticks. Two players, A and B, alternate turns. Ineach turn, a player may pick up 1, 2, or 3 sticks. Player A goes first and the player who picksup the last stick wins. Use dynamic programming to determine an strategy for player A in whichplayer A always wins. You must use dynamic programming for this problem. You might begin byplaying the game with your study partners. There are 21 sticks. Two players, A and B, alternate turns. Ineach turn, a player may pick up 1, 2, or 3 sticks. Player A goes first and the player who picksup the last stick wins. Use dynamic programming to determine an strategy for player A in whichplayer A always wins. You must use dynamic programming for this problem. You might begin byplaying the game with your study partners.

Explanation / Answer

Player A must always make sure that the total number sticks Player A and B have combined after Player A's turn is an even number.  If this is followed  Then player B will be left with 4 sticks every game leaving Player A to win.

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.