Another heuristic for dealing with the zugzwang problem is Omid David and Nathan Netanyahu's verified null-move pruning. In verified null-move pruning, whenever the shallow null-move search indicates a fail-high, instead of cutting off the search from the current node, the search is continued with reduced depth.
Read more about this topic: Null-move Heuristic
Famous quotes containing the word verified:
“To regard the successful experiences which ensue from a belief as a criterion of its truth is one thing—and a thing that is sometimes bad and sometimes good—but to assume that truth itself consists in the process by which it is verified is a different thing and always bad.”
—William Pepperell Montague (1842–1910)