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.
My question is, if jumps are compulsory will there still be a need for quiescence search?
My thinking is that I can develop an implementation of quiescence search that first checks whether jumps are available. If there are then it can skip all non-jumping moves. If there's only one jumping move available, then I won't need to run a search at all.
I will therefore only use quiescence search if I initially don't have to make a jump on my first move. I will only active quiescence search in my alpha beta pruning becomes active. (The alpha beta will only be active if my first algorithm which first checks if there are jumps available returns a 0, which means there are no jumps available.)
- Is my thinking of implementing quiescence search correct?
My options are slim when it comes to optimizations due to serious memory constraints, hence I won't be using PVS or other algorithm like that as they require additional memory.