Abstract
This paper presents a distributed game tree search algorithm called DDS*. Based on communication overhead, storage requirement, speed up, and other 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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
