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

@article{Elnaggar2014,
title = {A Comparative Study of Game Tree Searching Methods},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2014.050510},
url = {http://dx.doi.org/10.14569/IJACSA.2014.050510},
year = {2014},
publisher = {The Science and Information Organization},
volume = {5},
number = {5},
author = {Ahmed A. Elnaggar and Mostafa Abdel Aziem and Mahmoud Gadallah and Hesham El-Deeb}
}