 Modern chess programs typically employ a variety of domain-independent extensions and reductions, searching some nodes to arbitrary depth while searching others to reduced depth depending on the configuration and history of moves in the tree.This is in contrast to the selective search or forward pruning of the early era