Realization of the Chess Mate Solver Application
Yugoslav journal of operations research, Tome 14 (2004) no. 2, p. 273
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
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.
Keywords:
Computer chess, game tree searching, alpha-beta optimization algorithm, decision
@article{YJOR_2004_14_2_a9,
author = {Vladan V. Vu\v{c}kovi\'c},
title = {Realization of the {Chess} {Mate} {Solver} {Application}},
journal = {Yugoslav journal of operations research},
pages = {273 },
year = {2004},
volume = {14},
number = {2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/YJOR_2004_14_2_a9/}
}
Vladan V. Vučković. Realization of the Chess Mate Solver Application. Yugoslav journal of operations research, Tome 14 (2004) no. 2, p. 273 . http://geodesic.mathdoc.fr/item/YJOR_2004_14_2_a9/