Realization of the chess mate solver application
DOI:
https://doi.org/10.2298/YJOR0402273VKeywords:
computer chess, game tree searching, alpha-beta optimization algorithm, decision theoryAbstract
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
*** (2000) Chess informant: Anthology of chess problems. http://www.sahovski.co.yu/acp.htm
Althofer, I. (1991) An additive evaluation function in chess. ICCA Journal, 14, (3), 137-141
Althofer, I. (1993) On telescoping linear evaluation functions. ICCA Journal, 16, (2), 91-94
Beal, D.F. (1984) Mating sequences in the quiescence search. ICCA Journal, 7, (3), 133-137
Beal, D.F., Botvinnik, M.M. (1986) Computers in chess-solving inexact search problems. ICCA Journal, 9, (2), 88-89
Bruin, A., Pijls, W., Plaat, A. (1994) Solution trees as a basis for game-tree search. ICCA Journal, 17, (4), 207-219
Donninger, C. (1993) Null move and deep search: Selective-search heuristics for obtuse chess programs. ICCA Journal, 16, (3), 137-143
Fray, P.W. (1978) Chess skill in man and machine, texts and monographs in computer science. Berlin, itd: Springer Verlag
Grand, H. (1986) The impact of computers on chess-problem composition. ICCA Journal, 9, (3), 152-153
Kaindl, H., Horacek, H., Wagner, M. (1986) Selective search versus brute force. ICCA Journal, 9, (3), 140-145
Lindner, L. (1983) Experience with the second human-computer problem test. ICCA Journal, 6, (3), 10-15
Lindner, L. (1985) A test to compare human and computer fairy-chess problem solving. ICCA Journal, 8, (3), 150-155
Schlosser, M. (1988) Computers and chess-problem composition. ICCA Journal, 11, (4), 151-155
Shannon, C.E. (1949) Programming a computer for playing chess. u: National IRE Convention, March 9, New York, U.S.A
Shannon, C.E. (1950) A chess-playing machine. Sci Am, 182(2): 48-51, ill
Wiereyn, P.H. (1985) Inventive problem solving. ICCA Journal, 8, (4), 230-234
Downloads
Published
Issue
Section
License
Copyright (c) YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.