Both problems are about the game of 2 player PIG where both players are racing to be the first to Naquares points. Player 1 goes first. Assume both players are trying to maximize the chance they win the game. (e.g. they get no credit for coming in second even if they are close). We will use the ordinary 6 sided dice version of PIG (a “I" is a bust, and you advance by 2,3,4,5) Problem 1 - Optimal Strategy in 2 Player Pig a) Model the game as a Markov Decision Process. What is the state space? What are the possible actions? What are the transition probabilities? What are the rewards? b) When both players play optimally, the winning probability for Player 1 from a given state is closely related to the winning probability for Player 2 a given state. What is this relationship? c) Using the answer from parts a) and b) to setup a value iteration algorithm to find the optimal strategy in 2 player PIG. Your program should take as input Nquares and return the winning probability from any given state and the optimal action from any given state. 2 Problem 2 - Playing PIG against the enemy You are playing 2 player PIG against a particular adversary, who we will refer to as "the enemy". The enemies strategy is not known, but you have a chance to play against them as many times as you like. (This is given to you as a function, enemy_outcome, that returns the outcome of one turn of the enemies play. This function is random since the outcome also depends on enemy dice rolls) a) Implement the SARSA algorithm to find the optimal strategy to beat the enemy. Your program should take as input Naquares and the enemy_outcome function and return the winning probability from any given state and the opti- mal action from any given state. b) Explain why the output in Problem 2a) could be a different strategy than the optimal strategy you found in Problem 1lc). Explain what the word "optimal" means in Problem 1 and compare/contrast that to what "optimal" means in Problem 2.
Both problems are about the game of 2 player PIG where both players are racing to be the first to Naquares points. Player 1 goes first. Assume both players are trying to maximize the chance they win the game. (e.g. they get no credit for coming in second even if they are close). We will use the ordinary 6 sided dice version of PIG (a “I" is a bust, and you advance by 2,3,4,5) Problem 1 - Optimal Strategy in 2 Player Pig a) Model the game as a Markov Decision Process. What is the state space? What are the possible actions? What are the transition probabilities? What are the rewards? b) When both players play optimally, the winning probability for Player 1 from a given state is closely related to the winning probability for Player 2 a given state. What is this relationship? c) Using the answer from parts a) and b) to setup a value iteration algorithm to find the optimal strategy in 2 player PIG. Your program should take as input Nquares and return the winning probability from any given state and the optimal action from any given state. 2 Problem 2 - Playing PIG against the enemy You are playing 2 player PIG against a particular adversary, who we will refer to as "the enemy". The enemies strategy is not known, but you have a chance to play against them as many times as you like. (This is given to you as a function, enemy_outcome, that returns the outcome of one turn of the enemies play. This function is random since the outcome also depends on enemy dice rolls) a) Implement the SARSA algorithm to find the optimal strategy to beat the enemy. Your program should take as input Naquares and the enemy_outcome function and return the winning probability from any given state and the opti- mal action from any given state. b) Explain why the output in Problem 2a) could be a different strategy than the optimal strategy you found in Problem 1lc). Explain what the word "optimal" means in Problem 1 and compare/contrast that to what "optimal" means in Problem 2.
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
Related questions
Question
Problem 2 part a
Transcribed Image Text:Both problems are about the game of 2 player PIG where both players are
racing to be the first to Naquares points. Player 1 goes first. Assume both
players are trying to maximize the chance they win the game. (e.g. they get no
credit for coming in second even if they are close). We will use the ordinary 6
sided dice version of PIG (a "I" is a bust, and you advance by 2,3,4,5)
1 Problem 1 - Optimal Strategy in 2 Player Pig
a) Model the game as a Markov Decision Process. What is the state space?
What are the possible actions? What are the transition probabilities? What
are the rewards?
b) When both players play optimally, the winning probability for Player 1
from a given state is closely related to the winning probability for Player 2 a
given state. What is this relationship?
c) Using the answer from parts a) and b) to setup a value iteration algorithm
to find the optimal strategy in 2 player PIG. Your program should take as
input Naquares and return the winning probability from any given state and the
optimal action from any given state.
2 Problem 2 - Playing PIG against the enemy
You are playing 2 player PIG against a particular adversary, who we will refer
to as "the enemy". The enemies strategy is not known, but you have a chance
to play against them as many times as you like. (This is given to you as a
function, enemy_outcome, that returns the outcome of one turn of the enemies
play. This function is random since the outcome also depends on enemy dice
rolls)
a) Implement the SARSA algorithm to find the optimal strategy to beat the
enemy. Your program should take as input Naquares and the enemy_outcome
function and return the winning probability from any given state and the opti-
mal action from any given state.
b) Explain why the output in Problem 2a) could be a different strategy
than the optimal strategy you found in Problem 1lc). Explain what the word
"optimal" means in Problem 1 and compare/contrast that to what "optimal"
means in Problem 2.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 4 images
Knowledge Booster
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.Recommended textbooks for you
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
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)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education