Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN: 9780133594140
Author: James Kurose, Keith Ross
Publisher: PEARSON
Bartleby Related Questions Icon

Related questions

Question
100%

Look at the following image and provide solutions with good diagrams when needed!

Provide new solution!

1. This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts
and crosses) as an example. We define Xn as the number of rows, columns, or diagonals
with exactly n X's and no Os. Similarly, On is the number of rows, columns, or diagonals
with just n Os. The utility function assigns +1 to any position with X3=1 and -1 to any
position with 03=1. All other terminal positions have utility O. For nonterminal positions,
we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)-(3 02 (s)+ 01(s)).
a.
Approximately how many possible games of tic-tac-toe are there?
b.
Show the whole game tree starting from an empty board down to depth 2 (i.e.,
one X and one on the board), taking symmetry into account.
C. Mark on your tree the evaluations of all the positions at depth 2.
d. Using the minimax algorithm, mark on your tree the backed-up values for the
positions at depths 1 and 0, and use those values to choose the best starting
move.
expand button
Transcribed Image Text:1. This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts and crosses) as an example. We define Xn as the number of rows, columns, or diagonals with exactly n X's and no Os. Similarly, On is the number of rows, columns, or diagonals with just n Os. The utility function assigns +1 to any position with X3=1 and -1 to any position with 03=1. All other terminal positions have utility O. For nonterminal positions, we use a linear evaluation function defined as Eval(s)=3X2(s)+X1(s)-(3 02 (s)+ 01(s)). a. Approximately how many possible games of tic-tac-toe are there? b. Show the whole game tree starting from an empty board down to depth 2 (i.e., one X and one on the board), taking symmetry into account. C. Mark on your tree the evaluations of all the positions at depth 2. d. Using the minimax algorithm, mark on your tree the backed-up values for the positions at depths 1 and 0, and use those values to choose the best starting move.
Expert Solution
Check Mark
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Computer Networking: A Top-Down Approach (7th Edi...
Computer Engineering
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:PEARSON
Text book image
Computer Organization and Design MIPS Edition, Fi...
Computer Engineering
ISBN:9780124077263
Author:David A. Patterson, John L. Hennessy
Publisher:Elsevier Science
Text book image
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:9781337569330
Author:Jill West, Tamara Dean, Jean Andrews
Publisher:Cengage Learning
Text book image
Concepts of Database Management
Computer Engineering
ISBN:9781337093422
Author:Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:Cengage Learning
Text book image
Prelude to Programming
Computer Engineering
ISBN:9780133750423
Author:VENIT, Stewart
Publisher:Pearson Education
Text book image
Sc Business Data Communications and Networking, T...
Computer Engineering
ISBN:9781119368830
Author:FITZGERALD
Publisher:WILEY