Distributed tree search

Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner.

Uses your system voice; voice and rate in settings.

Snapshot

≈ 1 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

Distributed tree search (DTS) algorithm is a class of algorithms for searching values in an efficient and distributed manner. Their purpose is to iterate through a tree by working along multiple branches in parallel and merging the results of each branch into one common solution, in order to minimize time spent searching for a value in a tree-like data structure.

The original paper was written in 1988 by Chris Ferguson and Richard E. Korf, from the University of California, Los Angeles Computer Science Department. They used multiple other chess AIs to develop this wider range algorithm.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1357914835 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001357914835 · captured 1780656314.0 · version history

Cite this page as: encyclopegia.org, “Distributed tree search”, snapshot enwiki-001357914835. https://encyclopegia.org/a/distributed-tree-search

Sources cited in this revision

3 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.