Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Hsu, F.H.: IBM’s deep blue chess grandmaster chips. IEEE Micro 19(2), 70–81 (1999)
Fogel, D.B., Hays, T.J., Hahn, S.L., Quon, J.: A self-learning evolutionary chess program. Proc. IEEE 92(12), 1947–1954 (2004)
David, O.E., Netanyahu, N.S., Wolf, L.: DeepChess: end-to-end deep neural network for automatic learning in chess. In: Villa, A.E.P., Masulli, P., Pons Rivero, A.J. (eds.) ICANN 2016. LNCS, vol. 9887, pp. 88–96. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-44781-0_11
Thrun, S.: Learning to play the game of chess. In: Advances in Neural Information Processing Systems, pp. 1069–1076 (1995)
Baxter, J., Tridgell, A., Weaver, L.: KnightCap: a chess program that learns by combining with game-tree search. arXiv preprint cs/9901002 (1999)
Real, D., Blair, A.: Learning a multi-player chess game with TreeStrap. In: Proceedings of IEEE Evolutionary Computation Congress (CEC), pp. 617–623 (2016)
Wu, G., Tao, J.: Chinese chess algorithm design and implementation in the computer games. In: Proceedings of 35th Chinese Control Conference (CCC), pp. 10380–10384. IEEE (2016)
Vecek, N., Črepinsek, M., Mernik, M., Hrncic, D.: A comparison between different chess rating systems for ranking evolutionary algorithms. In: Proceedings of Conference on Computer Science and Information Systems (FedCSIS), pp. 511–518. IEEE (2014)
Dehghani, H., Babamir, S.M.: A GA based method for search-space reduction of chess game-tree. Appl. Intell. 47, 1–17 (2017)
David, O.E., van den Herik, H.J., Koppel, M., Netanyahu, N.S.: Genetic algorithms for evolving computer chess programs. IEEE Trans. Evol. Comput. 18(5), 779–789 (2014)
Borkowski, M., Palus, P., Waszczynski, M.: Metaheuristic chess artificial intelligence. AIC Report, Faculty of Electronics, Wroclaw University of Technology, Wroclaw (2014)
Kirkpatrick, S., Gelatti, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)
Pardalos, P.M., Pitsoulis, L., Mavridou, T., Resende, M.G.C.: Parallel search for combinatorial optimization: genetic algorithms, simulated annealing, tabu search and GRASP. In: Ferreira, A., Rolim, J. (eds.) IRREGULAR 1995. LNCS, vol. 980, pp. 317–331. Springer, Heidelberg (1995). https://doi.org/10.1007/3-540-60321-2_26
Kakol, A., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A., Burnham, K.J.: An experimentation system for testing bee behavior based algorithm to solving a transportation problem. In: Nguyen, N.T., Kim, C.-G., Janiak, A. (eds.) ACIIDS 2011. LNCS (LNAI), vol. 6592, pp. 11–20. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-20042-7_2
Bogalinski, P., Davies, D., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A.: Evaluation of strip nesting algorithms: an experimentation system for the practical users. J. Intell. Fuzzy Syst. 27(2), 611–623 (2014)
Jarecki, P., Kopec, P., Pozniak-Koszalka, I., Koszalka, L., Kasprzak, A., Chmaj, G.: Comparison of algorithms for finding best route in an area with obstacles. In: Proceedings of 25th International Conference on Systems Engineering (ICSEng), pp. 163–168. IEEE, Danvers (2017)
Shannon, C.E.: Programming computer for playing Chess. Philos. Mag. 41(314) (1950)
http://www.firenzina.org. Accessed Feb 2018
Acknowledgement
This work was supported by the statutory funds of the Department of Systems and Computer Networks, Wroclaw University of Science and Technology, Wroclaw, Poland, grant No. 0401/0154/17.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Klikowski, J., Karnicki, L., Poslednik, M., Koszalka, L., Pozniak-Koszalka, I., Kasprzak, A. (2018). Chess Problem: CSA Algorithm Based on Simulated Annealing and Experimentation System. In: Nguyen, N., Pimenidis, E., Khan, Z., Trawiński, B. (eds) Computational Collective Intelligence. ICCCI 2018. Lecture Notes in Computer Science(), vol 11056. Springer, Cham. https://doi.org/10.1007/978-3-319-98446-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-98446-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98445-2
Online ISBN: 978-3-319-98446-9
eBook Packages: Computer ScienceComputer Science (R0)