Skip to main content

Analyzing a Chess Engine Based on Alpha–Beta Pruning, Enhanced with Iterative Deepening

  • Conference paper
  • First Online:
Expert Clouds and Applications

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 444))

Abstract

Chess is a two-player strategy board game played on a chessboard, a checkered game board with 64 squares arranged in an 8 × 8 grid. The current technological advancements have transformed the way we not only play chess but study chess techniques and analyze the beautiful game. Predicting the next move in a chess game is not an easy task, as the branching factor of Chess on average is 35. Thus, new algorithms need to be researched to make an ideal Game Engine. In this paper, we analyze why the traditional algorithms fail to work for a Chess Engine and create one such engine which evaluates the Game Tree using the traditional Alpha–Beta Algorithm, enhanced by using Iterative Deepening Search.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 219.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 279.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Bashar, Survey on evolving deep learning neural network architectures. J. Artif. Intell. 1(02), 73–82 (2019)

    Google Scholar 

  2. Z. Zhao, S. Wu, J. Liang, F. Lv, C. Yu, The game method of checkers based on alpha-beta search strategy with iterative deepening, in The 26th Chinese Control And Decision Conference (2014 CCDC)

    Google Scholar 

  3. R. Nasa, R. Didwania, S. Maji, V. Kumar, Alpha-Beta Pruning in Minimax algorithm “An optimized approach for a connect-4 game”. Int. Res. J. Eng. Technol. (IRJET) (2018)

    Google Scholar 

  4. W. Guangyao, L. Hedan, Study on the algorithm based on the important region of the board, in 2018 Chinese Control And Decision Conference (CCDC)

    Google Scholar 

  5. A. Primanita, R. Effendi, W. Hidayat, Comparison of A∗ and Iterative Deepening A∗ algorithms for non-player character in Role Playing Game, in 2017 International Conference On Electrical Engineering And Computer Science (ICECOS) (2017)

    Google Scholar 

  6. A. Plaat, J. Schaeffer, W. Pijls, A. de Bruin, A new paradigm for minimax search. Technical Report Tr 94–18, Department Of Computing Science, The University Of Alberta, Edmonton, Alberta, Canada

    Google Scholar 

  7. T. Vijayakumar, Comparative study of capsule neural network in various applications. J. Artif. Intell. 1(01), 19–27 (2019)

    Article  Google Scholar 

  8. M. Tripathi, Analysis of convolutional neural network based image classification techniques. J. Innov. Image Processing (JIIP) 3(02), 100–117 (2021)

    Article  Google Scholar 

  9. I.J. Jacob, P. Ebby Darney, Design of deep learning algorithm for IoT application by image based recognition. J. ISMAC 3(03), 276–290 (2021)

    Google Scholar 

  10. G. Ranganathan, An economical robotic arm playing chess using visual servoing. J. Innov. Image Process. (JIIP) 2(03), 141–146 (2020)

    Article  Google Scholar 

  11. A.R. Mendes et al., Implementation of the automatic and interactive chess board. IOSR J. Electr. Electron. Eng. 9(6) (2014)

    Google Scholar 

  12. M. Tim Jones, AI and Games, in Artificial Intelligence: A Systems Approach (Hingham:Infinity Science Press, 2009), pp. 101–106

    Google Scholar 

  13. C. Matuszek, B. Mayton, R. Aimi, M.P. Deisenroth, L. Bo, R. Chu, et al., Gambit: an autonomous chess-playing robotic system, in Proceedings of International Conference on Robotics and Automation (2011), pp. 4291–4297

    Google Scholar 

  14. T. Cour, R. Lauranson, M. Vachette, autonomous chess-playing robot, Feb 2016

    Google Scholar 

  15. H.M. Luqman, M. Zaffar, Chess brain and autonomous chess playing robotic system, in 2016 International Conference on Autonomous Robot Systems and Competitions (ICARSC) (2016)

    Google Scholar 

  16. S. Ozan, S. Gümüstekin, A case study on logging visual activities: chess game, in Artificial Intelligence and Neural Networks (Springer, Berlin, 2006), pp. 1–10

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Aayush Parashar .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Parashar, A., Jha, A.K., Kumar, M. (2022). Analyzing a Chess Engine Based on Alpha–Beta Pruning, Enhanced with Iterative Deepening. In: Jacob, I.J., Kolandapalayam Shanmugam, S., Bestak, R. (eds) Expert Clouds and Applications. Lecture Notes in Networks and Systems, vol 444. Springer, Singapore. https://doi.org/10.1007/978-981-19-2500-9_51

Download citation

Publish with us

Policies and ethics