This problem exercises the basic concepts of game playing, using tic-tac-toe (noughts nd 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 osition with 03=1. All other terminal positions have utility O. For nonterminal positions, ve 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.

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

Refer to image! Provide good diagrams as well!

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.
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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 5 steps with 2 images

Blurred answer
Knowledge Booster
Intelligent Machines
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
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