For questions related to the quiescence search algorithm.
Questions tagged [quiescence-search]
5 questions
6
votes
1 answer
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 confused about the nature of these algorithms.
Are…
JoeyB
- 467
- 1
- 5
- 15
3
votes
2 answers
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?
JoeyB
- 467
- 1
- 5
- 15
2
votes
1 answer
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 be a need for a quiescence search?
My thinking is…
JoeyB
- 467
- 1
- 5
- 15
1
vote
1 answer
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 move but quiescence search includes it in the…
Aura Lee
- 239
- 1
- 7
1
vote
0 answers
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:
int Quiesce( int alpha, int beta ) {
int stand_pat = Evaluate();
if( stand_pat >= beta )
…
Carmellose
- 151
- 7