Copyright Statement: This is an open access article licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, even commercially as long as the original work is properly cited.
Digital Object Identifier (DOI) : 10.14569/IJACSA.2014.050510
Article Published in International Journal of Advanced Computer Science and Applications(IJACSA), Volume 5 Issue 5, 2014.
Abstract: 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.
Ahmed A. Elnaggar, Mostafa Abdel Aziem, Mahmoud Gadallah and Hesham El-Deeb, “A Comparative Study of Game Tree Searching Methods” International Journal of Advanced Computer Science and Applications(IJACSA), 5(5), 2014. http://dx.doi.org/10.14569/IJACSA.2014.050510