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.
A., A., Abdel, M., Gadallah, M., & El-Deeb, H. (2014). A Comparative Study of Game Tree Searching Methods. International Journal of Advanced Computer Science and Applications, 5(5). https://doi.org/10.14569/ijacsa.2014.050510