Genetic Algorithms for Mentor-Assisted Evaluation Function Optimization

11/18/2017
by   Eli David, et al.
0

In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function's parameters for computer chess. Our results show that using an appropriate mentor, we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Computer Chess Champion. This performance gain is achieved by evolving a program with a smaller number of parameters in its evaluation function to mimic the behavior of a superior mentor which uses a more extensive evaluation function. In principle, our mentor-assisted approach could be used in a wide range of problems for which appropriate mentors are available.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/18/2017

Expert-Driven Genetic Algorithms for Simulating Evaluation Functions

In this paper we demonstrate how genetic algorithms can be used to rever...
research
11/21/2017

Genetic Algorithms for Evolving Computer Chess Programs

This paper demonstrates the use of genetic algorithms for evolving: 1) a...
research
11/18/2017

Simulating Human Grandmasters: Evolution and Coevolution of Evaluation Functions

This paper demonstrates the use of genetic algorithms for evolving a gra...
research
09/02/2010

Optimizing Selective Search in Chess

In this paper we introduce a novel method for automatically tuning the s...
research
04/02/2011

Evolving a New Feature for a Working Program

A genetic programming system is created. A first fitness function f1 is ...
research
02/13/2011

Toward Measuring the Scaling of Genetic Programming

Several genetic programming systems are created, each solving a differen...
research
06/14/2018

Evolving simple programs for playing Atari games

Cartesian Genetic Programming (CGP) has previously shown capabilities in...

Please sign up or login with your details

Forgot password? Click here to reset