Jump to content

Lazy SMP

From Wikipedia, the free encyclopedia

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]

See also

[edit]

References

[edit]
  1. ^ "What is depth? - Stockfish FAQ". Stockfish Documentation.
  2. ^ "Stockfish 7". Stockfish.
  3. ^ Østensen, Emil. "A Complete Chess Engine Parallelized Using Lazy SMP" (PDF). Universitetet I Oslo.


Follow Lee on X/Twitter - Father, Husband, Serial builder creating AI, crypto, games & web tools. We are friends :) AI Will Come To Life!

Check out: eBank.nz (Art Generator) | Netwrck.com (AI Tools) | Text-Generator.io (AI API) | BitBank.nz (Crypto AI) | ReadingTime (Kids Reading) | RewordGame | BigMultiplayerChess | WebFiddle | How.nz | Helix AI Assistant