Archives

The Hub

Volume no. 8 | 2018/12
Issue no. 1


Title
The Efficiency of Gaming Algorithms: A Comparative Study Of Minimax and Alpha-Beta Algorithm
Author
Maria Diodel M. Suguitan, Mark Aaron V. Reyes, Lorenzo Angelo F. Arguelles, and Joshua James A. Daquilanea (BSCS) Researchers Mrs. Rhueliza R. Tordecilla Adviser
Views: 405 Cited: 0
Downloads: 1
Click here to download
Abstract
This study is entitled “ The Efficiency of Gaming Algorithms: A Comparative Study Of Minimax and Alpha-Beta Algorithm”. The researchers conducted this study to analyze which of the two algorithms, Minimax and Alpha-beta is more effective to use in a zero-sum perfect informations game in their decision making capabilities. This study will be beneficial for the researchers, computer science students, for future researchers and also for professional game developers; who will use this study as reference material befitting of their needs.The researchers were able to understand and analyze the algorithm with the use of a game simulation (Tic-Tac-Toe) made by the researchers. The main objective of the study is to compare the two algorithms using the game simulation in terms of performance and then come up with the conclusion on which algorithm is better to use. This study will be able to help the future researchers in further analyzing the depth of not just this two gaming/searching algorithms but also the different types of algorithm used in games.
Keywords
Keywords: Searching Algorithm, Zero-sum Games, Perfect Information Games, Alpha-beta Pruning, Minimax Algorithm, Artificial Intelligence, Data Analysis, Response Time, Execution Time, Memory Allocation
References
Anderson and Franceschi, Java Illuminated: An active Learning Approach 4th Ed., 2016 Ankudinov. Computer Fundamentals and DBMS, 2015 Brodie and Mylopolous, Integrating Artificial Intelligence & Database Technology on Knowledge Base Management Systems, 2012 Erickson, Algorithms, 2015 Harbour, Game Programming All in One, 2004 Heineman, Pollice and Selkov, Pathfinding Artificial Intelligence: Algorithms in a Nutshell 1st Ed., 2008 Jones, Artificial Intelligence: A Systems Approach, 2008 Kurzweil, Artificial Intelligence: The Age of Spiritual Machines. 1999 Louden, Programming Languages 3rd Ed., 2012 Mamčenko, Lecture Notes on Operating Systems, 2014 Pomperada, Introduction to Java Programming. 2016 Russell and Norvig, Artificial Intelligence: A Modern Approach 3rd Ed., 2010 Stallings, Operating Systems: Internals and Design Principles 7th Ed., 2012 Online References Gibbs, S. (2014). From windows 1 to windows 10: 29 years of windows evolution. https://www.theguardian.com/technology/2014/oct/02/fromwindows-1-to-windows-10-29-years-of-windows-evolution Higginbotham, D. (2012). An exhaustive explanation of minimax algorithm. http://www.flyingmachinestudios.com/programming/minimax/ Sulser, F. (2016). Advantages and disadvantages of minimax algorithm.https://stackoverflow.com/questions/36892813/mini max-algorithm-advantages-disadvantages Related Studies Kamble, Games with Vector Payoffs: A Dynamic Programming Approach, 2015 Carreon, M., Gonzalez, O., Niguidula, A.C., & Tubadeza, J.C. (Not Stated). Development of an ai system for robot soccer. (Unpublished Undergraduate Thesis). Philippines: University of the Philippines Diliman. Malek, A. (2017). Efficient sequential decision making. Berkeley: University of California. Elnaggar, A.A., Aziem, M.A., Gadallah, M., & El-Deeb, H. (2014). A comparative study of game tree searching methods. [Journal]. De Torres, G., Quizon, T., & Velasquez, S.J. (2011). Azurite: A mobile game using spatial hashing algorithm. (Unpublished Undergraduate Thesis) Batangas: Lyceum of the Philippines University