How do we find the length (depth) of the game tic-tac-toe in adversarial search? 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?
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.