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).

6 questions
Filter by
Sorted by
Tagged with
72 views

### Would the node with value 5 in this tree be pruned if doing left-to-right alpha-beta pruning?

I'm trying to understand if the node with value 5 would be pruned if doing left-to-right alpha-beta pruning in a minimax game. I can see two interpretations: Initialize $\alpha = -\infty$ and \$\beta =...
1 vote
254 views

### 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
231 views

### 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
4k views

### 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?
487 views

### 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?
• 163