- Source: Lazy SMP
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). 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.
See also
Minimax algorithm
Iterative deepening depth-first search
References
Kata Kunci Pencarian:
- The Lonely Island
- Tiara Park Waterboom
- Daftar episode K-On!
- Idol × Warrior Miracle Tunes!
- Wonpil
- Henry Lau
- Lazy SMP
- Tic-tac-toe
- Monty Hall problem
- Chopsticks (hand game)
- No-win situation
- Solving chess
- Saint Monica's Players
- Determinacy
- Memory ordering
- Eyesburn
