A GA based method for search-space reduction of chess game-tree

Abstract

In this study, a GA (Genetic Algorithm) basesented to reduce the chess game tree space. GA is exploited in some studies and by chess engines in order to: 1) tune the weights of the chess evaluation function or 2) to solve particular problems in chess like finding mate in number of moves. Applying GA for reducing the search space of the chess game tree is a new idea being proposed in this study. A GA-based chess engine is designed and implemented where only the branches of the game tree produced by GA are traversed. Improvements in the basic GA to reduce the problem of GA tactic are evident here. To evaluate the efficiency of this new proposed chess engine, it is matched against an engine where the Alpha-Beta pruning and Min-Max algorithm are applied.