4
$\begingroup$

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

$\endgroup$
0
$\begingroup$

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.

$\endgroup$
  • $\begingroup$ Re "a number of free spaces": Do you mean "the number of free spaces"? $\endgroup$ – Peter Mortensen Jun 9 at 14:45

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.