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).
5
questions
0
votes
1
answer
139
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 =...
- 39.7k
1
vote
2
answers
537
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?...
- 10.1k
3
votes
1
answer
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?
- 39.7k
4
votes
1
answer
548
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?
- 39.7k
6
votes
4
answers
6k
views
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 ...
- 39.7k