Comparison of Chess Engines: A Review

Authors

  • Singh RK Dept. of Computer Science & Engineering, Guru Ghasidas University, Bilaspur (CG), India
  • Negi SK Dept. of Computer Science & Engineering, Guru Ghasidas University, Bilaspur (CG), India
  • Chandra PK Dept. of Computer Science & Engineering, Guru Ghasidas University, Bilaspur (CG), India

Keywords:

Chess Engine, Pruning, Minimax

Abstract

The Chess engine alludes to a program that examines chess and chess variation positions. The first ever chess engine to have won against a human grandmaster was IBM’s DeepBlue in 1999. Since then multiple chess engines have emerged with improved search heuristics, hardware sets and dictionaries. Though in recent years many chess engines with a machine learning approach have produced striking achievements in comparison to the typical bruteforce chess engines. This paper aims to review the selected chess engines which generate counter moves automatically. Their respective specialties will be explained and compared to give insight on direction of research on chess game in modern world

References

C. E. Shannon, “Programming a Computer for Playing Chess”, Computer Chess Compendium, pp.2-13, 1983.

E. Okur and S. Kavuzlu, “Developing an Adaptive Chess Program”, Boazii University, 2011.

M. Lai, “Giraffe: Using Deep Reinforcement Learning to Play Chess”, Arxiv.org, 14 Sept. 2015.

G. M. Baudet, “An analysis of the full alpha-beta pruning algorithm”, Proceedings of the 10th annual ACM symposium on Theory of computing, 1978.

P. Cunningham, M. Cord and S. J. Delany, “Supervised Learning. Machine Learning Techniques for Multimedia Cognitive Technologies”, Springer, pp. 21-49, 2008.

E. Robert, Schapire, “Recent Advances in Reinforcement Learning”, Springer, pp.99-121, 1996.

D. Peleg, “Distributed Computing: A locally sensitive approach”, Society for Industrial and Applied Mathematics Philadelphia, PA, USA, 2000.

R. H. Netzer, B. P. Miller, “What are race conditions?: Some issues and formalizations”, ACM Letters on Programming Languages and Systems,1(1), pp.74-88, 1992.

R. W. Floyd, "Nondeterministic algorithms", Journal of the ACM (JACM), Vol.14, Issue.4, pp.636-644, 1967.

A. Rahul, G. Srinivasaraghavan, “Phoenix: A Self-

Optimizing Chess Engine”, International Conference on Computational Intelligence and Communication Networks (CICN), 2015.

J. Schaeffer, H. J. V. D. Herik, “Games, computers, and artificial intelligence”, Artificial Intelligence Elsevier Science, Vol.134, Issue.1-2, pp.1-7, 2002.

J. Esch, “A Self-Learning Evolutionary Chess Program”, Proceedings of the IEEE, Vol.92, Issue.12, pp.1946-1946, 2004.

E. Hearst, “Man and machine: Chess achievements and chess thinking”, Chess Skill in Man and Machine, pp.167-200, 1983.

N. Ensmenger, “Is chess the drosophila of artificial intelligence? A social history of an algorithm”, Social Studies of Science, Vol.42, Issue.1, pp.5-30, 2011.

C. J. Tan, “Deep Blue: A computer chess and massively parallel systems”, In Proceedings of the 9th international conference on Supercomputing (ICS’95), Barcelona, Spain, pp.237-239, 1995.

K. Dhou, “Chess software and its impact on chess players”, University of Northern British Columbia, 2008.

Downloads

Published

2025-11-24

How to Cite

[1]
R. K. Singh, S. K. Negi, and P. K. Chandra, “Comparison of Chess Engines: A Review”, Int. J. Comp. Sci. Eng., vol. 7, no. 3, pp. 209–213, Nov. 2025.

Issue

Vol. 7 No. 3 (2019): IJCSE Special Issue Feb Edition

Section

Review Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

Authors contributing to this journal agree to publish their articles under the Creative Commons Attribution 4.0 International License, allowing third parties to share their work (copy, distribute, transmit) and to adapt it, under the condition that the authors are given credit and that in the event of reuse or distribution, the terms of this license are made clear.