Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

Draw the subtree of the game tree for tic-tac-toe beginning at each of these positions. Determine the value of each of these subtrees.

Short Answer

Expert verified

(a)

(b)

(c)

(d) The value of the game is \({\bf{ + 1}}\).

Step by step solution

01

Define the values of all vertices in a game tree in a way that enables us to determine the outcome of this game when both players follow optimal strategies,

By a strategy mean a set of rules that tells a player how to select moves to win the game. An optimal strategy for the first player is a strategy that maximizes the payoff to this player and for the second player is a strategy that minimizes this payoff. We now recursively define the value of a vertex.

02

Firstly, determine the value of subtrees of part (a).

(a)

Consider the tic-tac-toe game,

Complete the sport by drawing the sub trees so determine the worth of the tree also. Here, the moves of \({\bf{x}}\) are \({\bf{4}}\) and move \({\bf{0}}\) are \({\bf{3}}\), then the next move is for \({\bf{0}}\).

Hence, the value zero within the figure indicates the worth of the tree and it’s zero because the sport attracts both cases.

03

Now, determine the value of subtrees of part (b).

Consider the tic-tac-toe game,

Complete the sport by drawing the sub trees so determine the worth of the tree also. Here, the moves of \({\bf{x}}\) are \({\bf{4}}\) and moves \({\bf{0}}\) are \({\bf{3}}\). then the next move is for \({\bf{0}}\).

Therefore, the value\({\bf{ + 1}}\)in the figure indicate the value of the tree and it is\({\bf{ + 1}}\)because\({\bf{x}}\)wins the game.

04

Now, determine the value of subtrees of part (c).

(c)

Consider the tic-tac-toe game,

Complete the sport by drawing the sub trees so determine the worth of the tree also. Here, the moves of \({\bf{x}}\) are 3 and moves 0 are 3 . Then the next move is for x .

Hence, the value +1 in the figure indicate the value of the tree. This is because following the min max criteria x wins.

05

Now, determine the value of subtrees of part (d).

Consider the tic-tac-toe game

Complete the sport by drawing the sub trees so determine the worth of the tree also. The game needs no other move because three appeared diagonally on a line so wins the game.

Therefore, the value of the game is +1 .

Unlock Step-by-Step Solutions & Ace Your Exams!

  • Full Textbook Solutions

    Get detailed explanations and key concepts

  • Unlimited Al creation

    Al flashcards, explanations, exams and more...

  • Ads-free access

    To over 500 millions flashcards

  • Money-back guarantee

    We refund you if you fail your exam.

Over 30 million students worldwide already upgrade their learning with Vaia!

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

Show that every tree can be colored using two colors. The rooted Fibonacci trees \({\bf{Tn}}\) are defined recursively in the following way. \({\bf{T1}}\)and\({\bf{T}}2\) are both the rooted tree consisting of a single vertex, and for \({\bf{n = 3, 4,}}...{\bf{,}}\) the rooted tree \({\bf{Tn}}\) is constructed from a root with \({\bf{Tn - }}1\) as its left subtree and \({\bf{Tn - 2}}\) as its right subtree.

Suppose that \({{\bf{d}}_{\bf{1}}}{\bf{,}}{{\bf{d}}_{\bf{2}}}{\bf{,}}...{\bf{,}}{{\bf{d}}_{\bf{n}}}\) are n positive integers with sum \({\bf{2n - 2}}\). Show that there is a tree that has n vertices such that the degrees of these vertices are \({{\bf{d}}_{\bf{1}}}{\bf{,}}{{\bf{d}}_{\bf{2}}}{\bf{,}}...{\bf{,}}{{\bf{d}}_{\bf{n}}}\).

Show that Sollin’s algorithm requires at most \({\bf{logn}}\) iterations to produce a minimum spanning tree from a connected undirected weighted graph with \({\bf{n}}\) vertices.

Answer these questions about the rooted tree illustrated.

  1. Which vertex is the root\(?\)
  2. Which vertices are internal\(?\)
  3. Which vertices are leaves\(?\)
  4. Which vertices are children of \({\bf{j}}\)\(?\)
  5. Which vertex is the parent of \({\bf{h}}\)\(?\)
  6. Which vertices are siblings of \({\bf{o}}\)\(?\)
  7. Which vertices are ancestors of \({\bf{m}}\)\(?\)
  8. Which vertices are descendants of \({\bf{b}}\)\(?\)

Draw a game tree for him if the starting position consists of two piles with two and three stones, respectively. When drawing the tree represent by the same vertex symmetric positions that result from the same move. Find the valueof each vertex of the game tree. Who wins the game if both players follow an optimal strategy?

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free