A Comparative Study of Game Tree Searching Methods
Computer Science Department, Modern Academy in Maadi, Cairo, Egypt
International Journal of Advanced Computer Science and Applications (IJACSA), Vol. 5, No. 5, 2014
In this paper, a comprehensive survey on gaming tree searching methods that can use to find the best move in two players zero-sum computer games was introduced. The purpose of this paper is to discuss, compares and analyzes various sequential and parallel algorithms of gaming tree, including some enhancement for them. Furthermore, a number of open research areas and suggestions of future work in this field are mentioned.
June 5, 2014 by hgpu