This paper introduces a new paradigm for minimax game-tree search algorithms.
MT is a memory-enhanced version of Pearl's Testprocedure. By changing
the way MT is called, a number of best-first game-tree search algorithms can be
simply and elegantly constructed (including SSS*).