I am looking for an efficient algorithm that lets me process the minimax search tree for chess with alpha-beta pruning on a distributed architecture. The algorithms I have found (PVS, YBWC, DTS see below) are all quite old (1990 being the latest). I assume there have been many substantial advancements since then. What is the current standard in this field?
Also please point me to an idiot's explanation of DTS as I can't understand it from the research papers that I have read.
The algorithms mentioned above:
- PVS: Principle Variation Splitting
- YBWC: Young Brothers Wait Concept
- DTS: Dynamic Tree Splitting
are all are discussed here.