4 relations: Alpha–beta pruning, List of algorithms, MTD-f, Principal variation search.
Alpha–beta pruning
Alpha–beta pruning is a search algorithm that seeks to decrease the number of nodes that are evaluated by the minimax algorithm in its search tree.
New!!: SSS* and Alpha–beta pruning · See more »
List of algorithms
The following is a list of algorithms along with one-line descriptions for each.
New!!: SSS* and List of algorithms · See more »
MTD-f
MTD(f) is a minimax search algorithm developed in 1994 by Aske Plaat, Jonathan Schaeffer, Wim Pijls, and Arie de Bruin.
New!!: SSS* and MTD-f · See more »
Principal variation search
Principal variation search (sometimes equated with the practically identical NegaScout) is a negamax algorithm that can be faster than alpha-beta pruning.
New!!: SSS* and Principal variation search · See more »