Notes about Winning Strategies for Some Combinatorial Games

Публікація:
Notes about Winning Strategies for Some Combinatorial Games

dc.contributor.author	Cherniichuk, Halyna P.
dc.contributor.author	Krykun, Ivan H.
dc.contributor.author	Крикун, Іван Григорович
dc.date.accessioned	2026-03-23T13:16:15Z
dc.date.issued	2022
dc.description.abstract	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.
dc.identifier.citation	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
dc.identifier.doi	http://dx.doi.org/10.31586/jml.2022.496
dc.identifier.issn	2377-8091
dc.identifier.orcid	https://orcid.org/0000-0001-5468-512X
dc.identifier.uri	https://dspace.krok.edu.ua/handle/krok/10282
dc.language.iso	en
dc.subject	combinatorial game theory
dc.subject	greedy algorithm
dc.subject	symmetric algorithm
dc.subject	tactix
dc.subject	nim
dc.subject	winning strategies
dc.title	Notes about Winning Strategies for Some Combinatorial Games
dc.type	Article
dspace.entity.type	Publication
relation.isAuthorOfPublication	bcec6d76-52fe-47ae-8db4-336b003ebaa1
relation.isAuthorOfPublication.latestForDiscovery	bcec6d76-52fe-47ae-8db4-336b003ebaa1

Зараз показуємо 1 - 1 з 1

Зараз показуємо 1 - 1 з 1