Skip to main content
2 votes
Accepted

What are the common techniques one could use to deal with collisions in a transposition table?

The term you're looking for is "replacement schemes". As far as I'm aware, the primary reference on this is still Replacement Schemes for Transposition Tables, although it is a fairly old paper from ...
Dennis Soemers's user avatar
  • 10.3k
2 votes

When should the iterative deepening search and the depth-limited search be used?

In practice, you can consider that IDS is a cheap way to implement a breadth-first search (BFS). When the branching factor is high, both algorithms have similar computational costs $O(B^P)$, where $P$ ...
salva's user avatar
  • 121
2 votes

When should the iterative deepening search and the depth-limited search be used?

If your search tree's branching factor is finite but its depth is unbounded, then DFS isn't "complete". What that means is that it may not ever find the goal node even if it exists. You would use ...
Peeyush Kushwaha's user avatar
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. ...
Dennis Soemers's user avatar
  • 10.3k

Only top scored, non community-wiki answers of a minimum length are eligible