Questions tagged [adversarial-search]

For questions related to the adversarial search problem (where there is more than one agent and the goals of these agents are in conflict) and algorithms to solve it (such as minimax).

Filter by
Sorted by
Tagged with
1 vote
2 answers

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

Consider the graph below for an understanding on how IDS work. Now my question is: why do IDS start at the root every iteration, why not start at the previously searched depth in the context of minmax?...
  • 11
0 votes
0 answers

Utility function vs evaluation function vs heuristic function in terms of minmax + alphabeta

So i am trying to grasp the difference between a utility function, an evaluation function and an heuristic function in terms of the minmax algorithm with alphabeta on top. So far my understanding is ...
  • 11
3 votes
1 answer

Why does the adversarial search minimax algorithm use Depth-First Search (DFS) instead of Breadth-First Search (BFS)?

I understand that the actual algorithm calls for using Depth-First Search, but is there a functionality reason for using it over another search algorithm like Breadth-First Search?
4 votes
1 answer

How do we find the length (depth) of the game tic-tac-toe in adversarial search?

When we perform the 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?
6 votes
4 answers

What else can boost iterative deepening with alpha-beta pruning?

I read about minimax, then alpha-beta pruning, and then about iterative deepening. Iterative deepening coupled with alpha-beta pruning proves to quite efficient as compared to alpha-beta alone. I have ...