How do we find the length (depth) of the game tic-tac-toe in adversarial search?

Question

When we perform the tic-tac-toe game using adversarial search, I know how to make a tree. Is there a way to find the depth of the tree, and which level is the last level?

score 0 · Accepted Answer · edited Jun 10 '19 at 18:09

0

If you mean minimax search as adversarial, you can take a number of free spaces on the board as an upper bound of the tree depth.

edited Jun 10 '19 at 18:09

Peter Mortensen

155
6

answered Dec 30 '18 at 03:03

Konstantin Solomatov

288
2
10

Re *"a number of free spaces"*: Do you mean *"the number of free spaces"*? – Peter Mortensen Jun 09 '19 at 14:45

How do we find the length (depth) of the game tic-tac-toe in adversarial search?

1 Answers1