摘要
This paper presents a distributed game tree search algorithm called DDS. Based on communication overhead, st,orage requirement, speed up, and oiller factors, the performance of algorithm DDS* is analysed, and the number of nodes searched with SSS as well as a-b algorithm. The simulation test shows that. DDS* is an efficient and practical search algorithm.
This paper presents a distributed game tree search algorithm called DDS. Based on communication overhead, st,orage requirement, speed up, and oiller factors, the performance of algorithm DDS* is analysed, and the number of nodes searched with SSS as well as a-b algorithm. The simulation test shows that. DDS* is an efficient and practical search algorithm.
