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 111
- Downloads 0
Detection of Cardiac Disease using Data Mining Classification Techniques
Cardiac Disease (CD) is one of the major causes of death. An important task is to identify the Cardiac disease very minutely and precisely. Generally medical diagnostic errors are dangerous and costly. Worldwide they are...
Determining adaptive thresholds for image segmentation for a license plate recognition system
A vehicle license plate recognition (LPR) system is useful to many applications, such as entrance admission, security, parking control, airport and cargo, traffic and speed control. This paper describe an adaptive thresh...
A Decision Tree Approach for Predicting Student Grades in Research Project using Weka
Data mining in education is an emerging multidiscipline research field especially with the upsurge of new technologies used in educational systems that led to the storage of massive student data. This study used classifi...
A Study to Investigate State of Ethical Development in E-Learning
Different researches evidenced that e-learning has provided more opportunities to behave unethically than in traditional learning. A descriptive quantitative enquiry-based study is performed to explore same issue in e-Le...
PRIVACY-PRESERVING CLUSTERING USING REPRESENTATIVES OVER ARBITRARILY PARTITIONED DATA
The challenge in privacy-preserving data mining is avoiding the invasion of personal data privacy. Secure computa- tion provides a solution to this problem. With the development of this technique, fully homomorphic encry...