1. Consider the following two person parlor game, which starts with n counters on the table in front of the two players. Players 1 and 2 move sequentially, player 1 moving first. When it is his turn to move, a player must remove either 1 or 2 counters from the table. The game ends when all the counters are removed, and the player who moves last wins the game. a) Suppose that n = 15. Solve the game by backwards induction. (Hint: let k be the number of counters left on the table. Focus on the winning positions the value of k where a player wins and losing positions for a player. Start with small values of k, i..c 'k = 1 and k = 2.) b) How would you generalize your answer in (a), so that for any n, you can determine which player wins the game in the backwards induction solution?.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
100%
1. Consider the following two-person parlor game, which starts with \( n \) counters on the table in front of the two players. Players 1 and 2 move sequentially, player 1 moving first. When it is his turn to move, a player must remove either 1 or 2 counters from the table. The game ends when all the counters are removed, and the player who moves last wins the game.
   
   a) Suppose that \( n = 15 \). Solve the game by backwards induction. (Hint: let \( k \) be the number of counters left on the table. Focus on the winning positions – the value of \( k \) where a player wins – and losing positions for a player. Start with small values of \( k \), i.e., \( k = 1 \) and \( k = 2 \).)
   
   b) How would you generalize your answer in (a), so that for any \( n \), you can determine which player wins the game in the backwards induction solution?
Transcribed Image Text:1. Consider the following two-person parlor game, which starts with \( n \) counters on the table in front of the two players. Players 1 and 2 move sequentially, player 1 moving first. When it is his turn to move, a player must remove either 1 or 2 counters from the table. The game ends when all the counters are removed, and the player who moves last wins the game. a) Suppose that \( n = 15 \). Solve the game by backwards induction. (Hint: let \( k \) be the number of counters left on the table. Focus on the winning positions – the value of \( k \) where a player wins – and losing positions for a player. Start with small values of \( k \), i.e., \( k = 1 \) and \( k = 2 \).) b) How would you generalize your answer in (a), so that for any \( n \), you can determine which player wins the game in the backwards induction solution?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Similar questions
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,