Consider the soda can game introduced in the class. Now suppose instead of a single circular table, there are two tables of identical size. A move consists of placing the can on any table (assuming there is a spot left on that table). Once placed, a can cannot move. The first one who cannot put a can on either table loses. In this game would you rather go first or second? Describe the winning strategy.   2) In the take-chips-away game (with normal play rules):       (a) if the number of chips on the table is 15, does this represent a P-position or N-position? Describe the winning strategy.       (b) if the number of chips on the table is 8, does this represent a P-position or N-position? Describe the winning strategy.   3) In the take-chips-away game (with Misère play rules):       (a) if the number of chips on the table is 15, does this represent a P-position or N-position? Describe the winning strategy.       (b) if the number of chips on the table is 8, does this represent a P-position or N-position? Describe the winning strategy.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

1) Consider the soda can game introduced in the class. Now suppose instead of a single circular table, there are two tables of identical size. A move consists of placing the can on any table (assuming there is a spot left on that table). Once placed, a can cannot move. The first one who cannot put a can on either table loses. In this game would you rather go first or second? Describe the winning strategy.

 

2) In the take-chips-away game (with normal play rules):

      (a) if the number of chips on the table is 15, does this represent a P-position or N-position? Describe the winning strategy.

      (b) if the number of chips on the table is 8, does this represent a P-position or N-position? Describe the winning strategy.

 

3) In the take-chips-away game (with Misère play rules):

      (a) if the number of chips on the table is 15, does this represent a P-position or N-position? Describe the winning strategy.

      (b) if the number of chips on the table is 8, does this represent a P-position or N-position? Describe the winning strategy.

 

4) In the modified take-chips-away game (with normal play rules), we only allow for a player to take out either 1 or 2 chips (rather than up to 3). For this game:

      (a) if the number of chips on the table is 15, does this represent a P-position or N-position? Describe the winning strategy.

      (b) if the number of chips on the table is 8, does this represent a P-position or N-position? Describe the winning strategy.

 

5) Consider the game of Nim (with normal play rules):

      (a) Consider piles position (3, 7) (i.e., two piles with the first pile having 3 and the second having 7 chips). Does this represent a P-position or N-position? Describe the winning strategy.

      (b) Consider piles position (5, 0, 3, 2). Does this represent a P-position or N-position and why? You don't need to describe the winning strategy

Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Probability Problems
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education