In multi-player game tree search the standard algorithm used to find an optimal move is multi-player α-β. The algorithm we propose will dominate multi-player α-β with regards to the number of leaves pruned. If the number of leaves required to be evaluated can be reduced, deeper and faster searches are the result.
