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