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.