Chess Problem: CSA Algorithm Based on Simulated Annealing and Experimentation System

This paper concentrates on the algorithm based on simulated annealing approach. The algorithm was implemented for solving the formulated chess problem. The properties of the algorithm were analyzed taking into account the results of experiments made using the designed and implemented experimentation system. This system allows testing various configurations of the algorithm and comparing the effects with those obtained by the algorithms based on ant colony optimization and genetic evolutionary ideas. The paper shows that the proposed algorithm seems to be promising.

[1]  D.B. Fogel,et al.  A self-learning evolutionary chess program , 2004, Proceedings of the IEEE.

[2]  Leszek Koszalka,et al.  Evaluation of strip nesting algorithms: An experimentation system for the practical users , 2014, J. Intell. Fuzzy Syst..

[3]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[4]  Bin Li,et al.  Link prediction based on sampling in complex networks , 2017, Applied Intelligence.

[5]  Keith J. Burnham,et al.  An Experimentation System for Testing Bee Behavior Based Algorithm to Solving a Transportation Problem , 2011, ACIIDS.

[6]  Panos M. Pardalos,et al.  Parallel Search for Combinatorial Optimization : Genetic Algorithms , Simulated Annealing , Tabu Search and GRASP ? , 1995 .

[7]  Claude E. Shannon,et al.  Programming a computer for playing chess , 1950 .

[8]  Andrew Tridgell,et al.  KnightCap: A Chess Programm That Learns by Combining TD(lambda) with Game-Tree Search , 1998, ICML.

[9]  Marjan Mernik,et al.  A comparison between different chess rating systems for ranking evolutionary algorithms , 2014, 2014 Federated Conference on Computer Science and Information Systems.

[10]  Gui Wu,et al.  Chinese chess algorithm design and implementation in the computer games , 2016, CCC 2016.

[11]  Nathan S. Netanyahu,et al.  DeepChess: End-to-End Deep Neural Network for Automatic Learning in Chess , 2016, ICANN.

[12]  Sebastian Thrun,et al.  Learning to Play the Game of Chess , 1994, NIPS.

[13]  Claude E. Shannon,et al.  XXII. Programming a Computer for Playing Chess 1 , 1950 .

[14]  Leszek Koszalka,et al.  Comparison of Algorithms for Finding Best Route in an Area with Obstacles , 2017, 2017 25th International Conference on Systems Engineering (ICSEng).

[15]  Alan Blair,et al.  Learning a multi-player chess game with TreeStrap , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[16]  Feng-Hsiung Hsu,et al.  IBM's Deep Blue Chess grandmaster chips , 1999, IEEE Micro.

[17]  H. Jaap van den Herik,et al.  Genetic Algorithms for Evolving Computer Chess Programs , 2014, IEEE Transactions on Evolutionary Computation.

[18]  Seyed Morteza Babamir,et al.  A GA based method for search-space reduction of chess game-tree , 2017, Applied Intelligence.