Changes

Bobby applied a so called ''Strategic Quiescence Search'' as described in a 1989 [[ICGA Journal|ICCA Journal]] paper by [[Günther Schrüfer]] <ref>[[Günther Schrüfer]] ('''1989'''). ''A Strategic Quiescence Search''. [[ICGA Journal|ICCA Journal]], Vol. 12, No. 1, pp. 3-9</ref>. Schrüfer claimed the inclusion of certain [[Quiet Moves|none tactical moves]] in [[Quiescence Search|quiescence search]] an improvement over a pure tactical search in Bobby. He also stated, for some programs it might be a significant speed penalty in the number of [[Nodes per secondSecond|moves searched per second]] to do so, i.e. in [[Move Generation|generating]] quiet moves. In Bobby this was irrelevant, since many of the values required have been precomputed for each node in any case. Beside the standard [[Quiescence Search#StandPat|standing pat]] [[Pruning|forward pruning]] conditions FP1 and FP2, all successors, not only [[Captures|captures]], [[Promotions|promotions]] and [[Check|checks]], were tested versus the forward pruning condition FP3.