0
3.4kviews
Draw a game tree for a Tic-Tac-Toe problem.

Mumbai University > Computer Engineering > Sem 7 > Artificial Intelligence

Marks: 4 Marks

Year: Dec 2015

1 Answer
0
182views

Consider A as intermediate state for initiating game tree where,

X is to play

Assume Goal State = ‘X’ Wins = 1

Thus, ‘o’ wins = -1 & draw = 0

The game tree is as below:

enter image description here

Please log in to add an answer.