Question

Consider a modified version of the very famous tic-tac-toe game in which player 1 moves, then...

Consider a modified version of the very famous tic-tac-toe game in which player 1 moves, then player 2 moves, and then player 3 moves and the game ends. The number of strategies for player 1, 2, and, 3 are respectively:

a.

9, 72, and 504.

b.

None of the available options in this list.

c.

9, 9, and 9.

d.

9, 8, and 7.

Homework Answers

Answer #1

Answer is option A)

since first player can select any of the 9 positions available,

So he has 9 strategies.

Now the second player moves, & he face total 9 nodes,

& At each node, he can select any of the 8 positions vacant .

So total strategies = 8*9 = 72

( 8 strategies at each of 9 nodes)

Now P3 moves ,

Now he faces total 8*9 = 72 nodes

At each node, he have 7 positions vacant,

So 7 strategies available at each of 72 nodes

Total strategies = 7*72

= 504

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
JAVA Programming * create a 3 dimensional tic tac toe game. make 1 player the computer.
JAVA Programming * create a 3 dimensional tic tac toe game. make 1 player the computer.
Prove that the first player in a game of (the usual 3 × 3) tic-tac-toe can...
Prove that the first player in a game of (the usual 3 × 3) tic-tac-toe can always (at least) force a draw. Note that one way to do this is to draw the full game tree, but there is an easier proof.
Write a program that allows two players to play a game of tic-tac-toe. Use a twodimensional...
Write a program that allows two players to play a game of tic-tac-toe. Use a twodimensional char array with three rows and three columns as the game board. Each element in the array should be initialized with an asterisk (*). The program should run a loop that: • Displays the contents of the board array. • Allows player 1 to select a location on the board for an X. The program should ask the user to enter the row and...
Consider a modified sequential version of Paper Scissors Rock where Player 1 goes first and chooses...
Consider a modified sequential version of Paper Scissors Rock where Player 1 goes first and chooses Paper, Scissors or Rock, and Player 2 goes second and chooses Paper, Scissors, or Rock. For each player, a win gets a payoff of 1, a loss gets a payoff of -1, and a tie get a payoff of 0. (a) (9 points) Write out the entire game tree for this sequential game. (b) (4 points) Find all the subgame perfect equilibria using backwards...
Part 1: Create the grid tic-tac-toe gameboard using buttons and iteration. Part 2: Human user gets...
Part 1: Create the grid tic-tac-toe gameboard using buttons and iteration. Part 2: Human user gets to select an open cell on the grid - place an X on that button selected Part 3: Check for a win using DOM iteration - new game option if row or column matching X pattern Part 4: Computer gets to select an open cell on the grid - place an O on that button selected Part 5: Check for a win using DOM...
Consider the original divide the dollar game of question (3). How many strategies does player 1...
Consider the original divide the dollar game of question (3). How many strategies does player 1 have? How many strategies does player 2 have? Write down all the strategies of player 1, and two strategies of player 2. Explain briefly (in a line or two) why you wrote the strategies of player 2 in the way you wrote them. Question 3-Consider the following game of divide the dollar. There is a dollar to be split between two players. Player 1...
Consider the Matching Pennies game: Player B- heads Player B- tails Player A- heads 1, -1...
Consider the Matching Pennies game: Player B- heads Player B- tails Player A- heads 1, -1 -1, 1 Player A- tails -1, 1 1, -1 Suppose Player B always uses a mixed strategy with probability of 1/2 for head and 1/2 for tails. Which of the following strategies for Player A provides the highest expected payoff? A) Mixed strategy with probability 1/4 on heads and 3/4 on tails B) Mixed Strategy with probability 1/2 on heads and 1/2 on tails...
Consider the below 2x2 normal form game. Player 2 C D Player 1 A 5,2 1,3...
Consider the below 2x2 normal form game. Player 2 C D Player 1 A 5,2 1,3 B 4,3 2,1       Assume that Player 1 plays A with p probablity and B with (1-p) probability as Player 2 plays C with q probability and D with (1-q). Given that players are rational, which of the following is true? a. If p = 1/2, then Player 2 Plays C. b. If p =2/3, then Player 2 Plays D. c. If q =1/4,...
Consider a game in which player 1 selects effort x and player 2 selects effort y,...
Consider a game in which player 1 selects effort x and player 2 selects effort y, where x and y must be between 1 and 12 (inclusive). Payoffs are given by: u1(x,y) = cxy – x2 , u2(x,y) = 2xy – y2 . where c > 0 is a parameter. 1. What is the best response function for each player? 2. What is the B1 and B2 for each player if c = 1? 3. What is the rationalizable set...
Consider a game in which player 1 selects effort x and player 2 selects effort y,...
Consider a game in which player 1 selects effort x and player 2 selects effort y, where x and y must be between 1 and 12 (inclusive). Payoffs are given by: u1(x,y) = cxy – x2, u2(x,y) = 2xy – y2. where c > 0 is a parameter. 1. What is the best response function for each player? 2. What is the B1 and B2 for each player if c = 1? 3. What is the rationalizable set if c...