January 26, Wednesday
12:00 – 13:30
Using Tree-Based GP to Apply the Evolutionary Approach to Board Games
Graduate seminar
Lecturer : Amit Benbassat
Affiliation : CS, BGU
Location : 202\37
Host : Graduate Seminar
Over the past decades the evolutionary approach has been used in many fields of computer science research. Lately, with the growth of computation power, Genetic Programming (GP) has been showing much promise.
Our work is an attempt to apply the tree based GP approach to several zero-sum deterministic full knowledge to board games. We present published results on Lose Checkers as well as yet unpublished improved results, and also results on two other board games: 10X10 Checkers, and Reversi. Our system implements strongly typed GP trees, explicitly defined introns and multi-tree individuals. We use the GP trees to evaluate possible future game states. Used together with traditional search techniques the results show much promise and imply that tree based GP may be useful in finding good players for other similar games.