4 votes

If certain moves are compulsory, will there still be a need for a quiescence search?

I understand your question to be: If some moves are compulsory, and my agent has no choice about which move to make next, do I need to perform a search, or can I just return the compulsory move? ...
user avatar
4 votes

Is a good evaluation function as good as any of the extensions of alpha-beta pruning?

To build on Neil's answer a bit, you're right that the better your evaluation function gets, the less work your optimization function will need to perform. If your evaluation function gets good enough,...
user avatar
2 votes

Is a good evaluation function as good as any of the extensions of alpha-beta pruning?

A perfect evaluation function would mean that you only had to do a local search - i.e. maximise over next set of decisions - in order for an agent to behave optimally in an environment. As such if ...
user avatar
  • 24.5k
1 vote
Accepted

Does quiescence search even improve the minimax algorithm?

Your logic is flawed because you negated "stand-pat" (i.e. do nothing) and alpha-beta. Let's take a look at the pseudocode (https://www.chessprogramming.org/Quiescence_Search#Pseudo_Code): ...
user avatar
  • 1,390
1 vote
Accepted

Are iterative deepening, principal variation search or quiescence search extensions of alpha-beta pruning?

Are these algorithms an extension of the alpha-beta algorithm, or Are they completely new algorithms, in that they have got nothing to do the alpha-beta algorithm? Most of them are extensions of ...
user avatar
  • 9,459

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