<p>If you mean <a href="https://en.wikipedia.org/wiki/Minimax" rel="nofollow noreferrer">minimax search</a> as adversarial, you can take a number of free spaces on the board as an upper bound of the tree depth. </p>

CC BY-SA 4.0
2019-06-09T14:45:41.173Z
Re *"a number of free spaces"*: Do you mean *"the number of free spaces"*?
Peter Mortensen
CC BY-SA 4.0
2018-12-30T03:03:55.090Z
2019-06-10T18:09:41.140Z
2019-06-10T18:09:41.140Z
Konstantin Solomatov
<p>When we perform the <a href="https://en.wikipedia.org/wiki/Tic-tac-toe" rel="nofollow noreferrer">tic-tac-toe</a> 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?</p>

<game-ai><search><minimax><tic-tac-toe><adversarial-search>
How do we find the length (depth) of the game tic-tac-toe in adversarial search?
Adil Mustafa
# How do we find the length (depth) of the game tic-tac-toe in adversarial search?

(Asked by: username_0 on 2018-12-07)

When we perform the [tic-tac-toe](https://en.wikipedia.org/wiki/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?

**Tags:** game-ai, search, minimax, tic-tac-toe, adversarial-search


---

## 1 answers

### Answer by username_1 on 2018-12-30. Score: 0 | Accepted answer

If you mean [minimax search](https://en.wikipedia.org/wiki/Minimax) as adversarial, you can take a number of free spaces on the board as an upper bound of the tree depth.

> **Comments:**
> **username_2**: Re *"a number of free spaces"*: Do you mean *"the number of free spaces"*?  

---

