A Comparative Study of Game Tree Searching Methods
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2014, Vol 5, Issue 5
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.
Authors and Affiliations
Ahmed Elnaggar, Mostafa Aziem, Mahmoud Gadallah, Hesham El-Deeb
Keywords
Related Articles
- EP ID EP115973
- DOI 10.14569/IJACSA.2014.050510
- Views 110
- Downloads 0
Optical Recognition of Isolated Machine Printed Sindhi Characters using Fourier Descriptors
The scale invariance characteristics play an essential role in pattern recognition applications, for example in computer vision, OCR (Optical Character Recognition), electronic publication, etc. In this paper, the shape...
Forecasting Production Values using Fuzzy Logic Interval based Partitioning in Different Intervals
Fuzzy time series models have been put forward for rice production from many researchers around the globe, but the prediction has not been very accurate. Frequency density or ratio based partitioning methods have been us...
Mood Extraction Using Facial Features to Improve Learning Curves of Students in E-Learning Systems
Students’ interest and involvement during class lectures is imperative for grasping concepts and significantly improves academic performance of the students. Direct supervision of lectures by instructors is the main reas...
Cryptocurrency Mining – Transition to Cloud
Cryptocurrency, a form of digital currency that has an open and decentralized system and uses cryptography to enhance security and control the creation of new units, is touted to be the next step from conventional moneta...
Medical Image Retrieval based on the Parallelization of the Cluster Sampling Algorithm
Cluster sampling algorithm is a scheme for sequential data assimilation developed to handle general non-Gaussian and nonlinear settings. The cluster sampling algorithm can be used to solve a wide spectrum of problems tha...