In combinatorial game theory, Lazy SMP is a parallelization technique for tree searching by launching the various depths used in iterative deepening on their respective threads (the technique used by Stockfish[1][2]). Combined with a concurrent transposition table, the non-determinism of these threads leads to speed gains when different depths encounter games already searched by other threads. Lazy SMP was described, but not discovered, by Daniel Homan in a chess form.[3]
