|
Title:
|
GENETIC ALGORITHM FOR SOLVING CHESS ENDGAMES |
|
Author(s):
|
Antonio Gómez-iglesias , Miguel A. Vega-rodríguez , Juan M. Sánchez-pérez , Juan A. Gómez-pulido |
|
ISBN:
|
978-972-8924-30-0 |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2007 |
|
Edition:
|
Single |
|
Keywords:
|
Genetic algorithms, chess endgames, tree, mutation, board evaluation. |
|
Type:
|
Short Paper |
|
First Page:
|
454 |
|
Last Page:
|
458 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
In this paper we propose a genetic algorithm for solving chess endgames. We present a system that can evaluate a chess play and find the best solution for the situation found, and can also evolve to achieve better results in future iterations. Our genetic algorithm is a low computational cost algorithm unlike the brute-force algorithms typically used to resolve chess problems. |
|
|
|
|
|
|
