Abstract
The chess game engine is introduced which makes use of a minimax algorithm for searching game trees and makes use of alpha–beta pruning algorithm to reduce the search space of game states in the game state tree. The first part of this paper is an expository presentation that demonstrates and explains the minimax algorithm. The work in this paper demonstrates that the alpha–beta pruning method improves the efficiency of the chess engine algorithm based on the results obtained using rigorous experimentation.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Guo T, Qiu H, Tong B, Wang Y (2019) Optimization and comparison of multiple game algorithms in amazon chess. In: 2019 Chinese control and decision conference (CCDC). pp 6299–6304. https://doi.org/10.1109/CCDC.2019.8833089
Hu C, Wu X, Qian T, Luo H, Wang J (2020) An improved knowledge base for Chinese chess game. In: IEEE 4th information technology, networking, electronic and automation control conference (ITNEC). pp 1486–1490. https://doi.org/10.1109/ITNEC48623.2020.9085142
Vuckovic V (2015) Candidate Moves Method implementation in MiniMax search procedure of the Achilles chess engine. In: 12th International conference on telecommunication in modern satellite, cable and broadcasting services (TELSIKS). pp 314–317. https://doi.org/10.1109/TELSKS.2015.7357795
Experiments with Game tree search in real-time strategy games. arXiv:1208.1940v1 [cs.AI] 9 Aug 2012
Marsland TA, Bjornsson Y From minimax to manhattan. Games AI Res 5–17
Gillogly JJ (1972) The technology chess program. Artif Intell 3:145–163
Knuth DE, Moore RW (1975) An Analysis of alpha-beta pruning. Artif Intell 6(4):293–326. ISSN 0004-3702. https://doi.org/10.1016/0004-3702(75)90019-3.
Wang XZ, He Y-L, Su P, Li W-L (2009) Two-ply iterative deepening in Chinese-chess computer game. International conference on machine learning and cybernetics. pp 2020–2026. https://doi.org/10.1109/ICMLC.2009.5212141
Shannon CE (1950) Programming a computer for playing chess. Phil Mag 41(7):256–275
Stockfish—an open source chess engine (2022) http://stockfishchess.org
Acknowledgements
The academic assistance of Dr. Vishwanath Karad MIT World Peace University was crucial for the completion of this work. We are particularly grateful to Dr. Vrushali Kulkarni, who serves as the Head of School for the Computer Engineering and Technology Department, and Dr. Preeti Kale, who taught the Artificial Intelligence course and provided valuable advice and support.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Choudhary, H., Inamdar, A., Kharade, S., Maheshwari, A., Kale, P. (2023). Comparative Analysis of Minimax Algorithm with Alpha–Beta Pruning Optimization for Chess Engine. In: Borah, S., Gandhi, T.K., Piuri, V. (eds) Advanced Computational and Communication Paradigms . ICACCP 2023. Lecture Notes in Networks and Systems, vol 535. Springer, Singapore. https://doi.org/10.1007/978-981-99-4284-8_19
Download citation
DOI: https://doi.org/10.1007/978-981-99-4284-8_19
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-4283-1
Online ISBN: 978-981-99-4284-8
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)