Realization of the chess mate solver application

Authors

  • Vladan V. Vučković Faculty of Electronic Engineering, University of Niš, Niš, Serbia & Montenegro

DOI:

https://doi.org/10.2298/YJOR0402273V

Keywords:

computer chess, game tree searching, alpha-beta optimization algorithm, decision theory

Abstract

This paper presents details of the chess mate solver application, which is a part of the author’s Geniss general chess application. The problem chess is an important domain connected with solving of the chess problems. The Geniss Mate Solver (G.M.S.) application solves Mate-in-N-move problems. Main techniques used for the implementation of the application are full-width searching with Alpha-Beta pruning technique and zero evaluation function. The application is written in Delphi for Windows programming environment and the searching engine is completely coded in assembly language (about 10000 lines). This hybrid software structure enables efficient program development by using high-level programming environment and the realization of a very fast searching engine at the same time. The machine code is manually coded and could achieve above 7 million generated positions per second on the 1Ghz Celeron PC.

References

Althöfer, I., “An additive evaluation function in chess”, ICCA Journal, 14 (3) (1991) 137-141.

Althöfer, I., “On telescoping linear evaluation functions”, ICCA Journal, 16 (2) (1993) 91-94.

Beal, D.F., “Mating sequences in the quiescence search”, ICCA Journal, 7 (3) (1984) 133-137.

Beal, D.F., and Botvinnik, M.M., “Computers in chess - solving inexact search problems”, ICCA Journal, 9 (2) (1986) 88-89.

Bruin, A., Pijls, W., and Plaat, A., “Solution trees as a basis for game-tree search”, ICCA Journal, 17 (4) (1994) 207-219.

Chess Informant: Anthology of Chess Problems, http://www.sahovski.co.yu/acp.htm, 2000.

Donninger, C., “Null move and Deep Search: selective-search heuristics for obtuse chess programs”, ICCA Journal, 16 (3) (1993) 137-143.

Fray, P.W., Chess Skill in Man and Machine, Texts and Monographs in Computer Science, Springer-Verlag, New York, U.S.A, 1978.

Grand, H., “The impact of computers on chess-problem composition”, ICCA Journal, 9 (3) (1986) 152-153.

Kaindl, H., Horacek, H., and Wagner, M., “Selective search versus brute force”, ICCA Journal, 9 (3) (1986) 140-145.

Lindner, L., “Experience with the second human-computer problem test”, ICCA Journal, 6 (3) (1983) 10-15.

Lindner, L., “A test to compare human and computer fairy-chess problem solving”, ICCA Journal, 8 (3) (1985) 150-155.

Shannon, C.E., “Programming a computer for playing chess”, National IRE Convention, March 9, New York, U.S.A, 1949.

Shannon, C.E., “A chess-playing machine”, reprinted with permission, Scientific American, U.S.A., 1950.

Schlosser, M., “Computers and chess-problem composition”, ICCA Journal, 11 (4) (1988) 151-155.

Wiereyn, P.H., “Inventive problem solving”, ICCA Journal, 8 (4) (1985) 230-234.

Downloads

Published

2004-09-01

Issue

Vol. 14 No. 2 (2004)

Section

Research Articles

License

Copyright (c) 2004 YUJOR

Creative Commons License

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