Eduardo Vázquez-Fernández
ABSTRACT
This paper presents a method for adjusting weights of the evaluation function of a chess engine. Such an adjustment is carried out through an evolutionary algorithm which adopts a mechanism that selects the virtual players (individuals in the population) that have the highest number of problems properly solved from a database of typical chess problems. This method has the advantage that we only mutate those weights involved in the solution of the current problem. Furthermore, the mutation mechanism is adapted through the number of problems solved by each virtual player. Our results indicate that the material values obtained by our approach are similar to the values known from chess theory. Additionally, we also show that, using the approach proposed here, the strength of our chess engine is increased in 335 points.
- D. Beal and M. C. Smith. Multiple probes of transposition tables. ICCA Journal, 19(4):227--233, 1996.Google Scholar
- L. J. Fogel. Artificial Intelligence through Simulated Evolution. John Wiley, New York, 1966.Google ScholarDigital Library
- D. E. Knuth and R. W. Moore. An analysis of alpha-beta pruning. Artificial Intelligence, 6(4):293--326, 1975.Google ScholarCross Ref
- Z. Michalewicz. Genetic AlgorithmsGoogle Scholar
- Data Structures = Evolution Programs. Springer-Verlag, second edition, 1996.Google Scholar
- F. Reinfeld. One Thousand and One Winning Chess Sacrifices and Combinations. Wilshire Book Company, 1969.Google Scholar
- C. Shannon. Programming a computer for playing chess. Philosophical Magazine, 7(41):256--275, 1950.\endthebibliographyGoogle Scholar
Index Terms
- An adaptive evolutionary algorithm based on typical chess problems for tuning a chess evaluation function
Recommendations
An evolutionary algorithm with a history mechanism for tuning a chess evaluation function
Here, we propose an evolutionary algorithm (i.e., evolutionary programming) for tuning the weights of a chess engine. Most of the previous work in this area has normally adopted co-evolution (i.e., tournaments among virtual players) to decide which ...
History mechanism supported differential evolution for chess evaluation function tuning
This paper presents a differential evolution (DE) based approach to chess evaluation function tuning. DE with opposition-based optimization is employed and upgraded with a history mechanism to improve the evaluation of individuals and the tuning ...
Research of Biogeography-Based Multi-Objective Evolutionary Algorithm
Biogeography-based optimization algorithm BBO is an optimization algorithm inspired by the migration of animals in nature. A new multi-objective evolutionary algorithm is proposed, which is called Biogeography-based multi-objective evolutionary ...
Comments