Algorithmresearch
Parallel alpha-beta search
Also called Young Brothers Wait, lazy SMP.
Alpha-beta parallelized across processors by searching eldest children first, then the rest in parallel.
Alpha-beta parallelized across processors by searching eldest children first, then the rest in parallel.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 8BYDFQ Edit this page History Report an error