Iterative deepening is a recursive procedure in which, we start searching to a fixed depth in the game tree. We apply the single evaluation function to the first branch, applying to it the result of possible moves. This will result in the initiation of a new minimax search, this time the depth getting increased to 2.this process gets repeated.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment