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?
$\begingroup$
$\endgroup$
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
1
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.
answered Dec 30, 2018 at 3:03
-
$\begingroup$ Re "a number of free spaces": Do you mean "the number of free spaces"? $\endgroup$ Commented Jun 9, 2019 at 14:45