Questions tagged [quiescence-search]
For questions related to the quiescence search algorithm.
5
questions
1
vote
0
answers
186
views
Negamax: how should you avoid the horizon effect in the connect four game?
I'm trying to implement a quiescence search in the negamax algorithm, for a connect four game.
The algorithm is as follow for a chess game:
...
- 171
1
vote
1
answer
1k
views
Does quiescence search even improve the minimax algorithm?
Consider this game state:
d5 captures c6
Quiescence search returns about 8.0 as evaluation because after dxc6 and bxc6 Qxd6 would be played (then Qxd6 by black). A normal player would not play this ...
- 239
2
votes
1
answer
551
views
If certain moves are compulsory, will there still be a need for a quiescence search?
Certain games, like checkers, have compulsory moves. In checkers, for instance, if there's a jump available a player must take it over any non-jumping move.
If jumps are compulsory, will there still ...
- 477
3
votes
2
answers
513
views
Is a good evaluation function as good as any of the extensions of alpha-beta pruning?
I would like to know if having a really good evaluation function is as good as using any of the extensions of alpha-beta pruning, such as killer moves or quiescence search?
- 477
6
votes
1
answer
1k
views
Are iterative deepening, principal variation search or quiescence search extensions of alpha-beta pruning?
I know that there are several optimizations for alpha-beta pruning. For example, I have come across iterative deepening, principal variation search, or quiescence search.
However, I am a little bit ...
- 477