Searching for Better Performance on the King-Rook-King Chess Endgame Problem

For many classification problems, genetic algorithms prove to be effective without extensive domain engineering. However, the chess King-Rook-King endgame problem appears to be an exception. We explore whether modifications to a baseline parallel genetic algorithm can improve the accuracy on this particular problem. After describing the problem domain and our implementation of a parallel genetic algorithm, we present an empirical evaluation of several approaches intended to improve overall performance. Our results confirm the challenging nature of this domain. We describe several directions that may yet deliver significant improvements.