Hi Don,
I never heard of this technique before. Are there any more you can share?
ManyFaces12 uses:
-Iterative deepening, with hash table
-Zero-window search (beta is alpha+1, and research when fail high)
-Null move (reduce depth by one, only try null when beta is not infinite,
only one null
David,
There are many variations of this technique, but what they all have in
common is the assumption that once you have searched some number of
child moves (perhaps 2 or 3) then (with good move ordering) there is
much reduced chance than one of the remaining moves will be
useful. Often