New answers tagged

1 vote

Why do iterative deepening search start from the root each iteration in the context of the minmax-algorithm?

Normally in minimax (or any form of depth-first search really), we do not store nodes in memory for the parts we have already searched. The tree is only implicit, it's not stored anywhere explicitly. ...
  • 9,519
0 votes

Why do iterative deepening search start from the root each iteration in the context of the minmax-algorithm?

I could be mistaken since I don't know the source of the image you have provided, but that image appears to be showing how the tree is built, not how it is searched. Even so, when a balanced tree of ...

Top 50 recent answers are included