Публікація: Notes about Winning Strategies for Some Combinatorial Games
Вантажиться...
Файли
Дата
DOI
http://dx.doi.org/10.31586/jml.2022.496
Назва видання
ISSN
Назва тому
Видання
Анотація
We study the theory of combinatorial games and find winning strategies for players. The algorithmic implementation of the winning strategies for the game TacTix is presented and the software implementation for this game in Python programming language is implemented. The program has a console interface and allows one to check the winning strategies in practice.
Опис
Ключові слова
combinatorial game theory, greedy algorithm, symmetric algorithm, tactix, nim, winning strategies
Бібліографічний опис
Cherniichuk Halyna P., Krykun Ivan H. Notes about Winning Strategies for Some Combinatorial Games. Journal of Mathematics Letters. 2022. Vol. 1. № 1. Pp. 1-9. http://dx.doi.org/10.31586/jml.2022.496
