Chapter 2 Game Tree Searching and pruning

Some alpha-beta refinements such as NegaScout and MTD(f) are derived from minimal window search. For some games with bushy trees, they provide a significant advantage.

http://www.cs.unm.edu/~aaron/downloads/qian_search.pdf