Answers.Body: <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>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2019-06-09T14:45:41.173Z
Answers.Text: Re *"a number of free spaces"*: Do you mean *"the number of free spaces"*?
Answers.UserDisplayName: Peter Mortensen
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2018-12-30T03:03:55.090Z
Answers.LastActivityDate: 2019-06-10T18:09:41.140Z
Answers.LastEditDate: 2019-06-10T18:09:41.140Z
Answers.UserDisplayName: Konstantin Solomatov
Body: <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>
  
Tags: <game-ai><search><minimax><tic-tac-toe><adversarial-search>
Title: How do we find the length (depth) of the game tic-tac-toe in adversarial search?
UserDisplayName: Adil Mustafa
ThreadText: # 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"*?  
  
  ---
  
  