Notes about Winning Strategies for Some Combinatorial Games
نویسندگان
چکیده
We study the theory of combinatorial games and find winning strategies for players. The algorithmic implementation game TacTix is presented software this in Python programming language implemented. program has a console interface allows one to check practice.
منابع مشابه
Games and Winning Strategies
'ILvo-person games are modeled as specifications in a language with angelic and demonic nondeterminism, and methods of program verification and transformation are used to reason about games. That a given strategy is winning can be proved using a variant of the traditional loop correctness rule. Furthermore, an implementation of the winning strategy can be derived using equivalence transformations.
متن کاملGames with additional winning strategies
In game theory, deciding whether a designed player wins a game corresponds to check whether he has a winning strategy. There are situations in which it is important to know whether some extra winning strategy also exists. In this paper we investigate this question over two-player finite games, under the reachability objective. We provide an automata-based technique that, given such a game, it a...
متن کاملComplexity of Winning Strategies for A° Games
For a AiJ game played on w, we show that the winning player has a winning strategy that is recursive in E! , where Ex is the total type-2 object that embodies operation sf . 0. Introduction The complexity of winning strategies for certain definable games played on co can, quite often, be expressed in terms of recursion in (appropriate) higher types. The simplest and the earliest known result is...
متن کاملTime-Optimal Winning Strategies for Poset Games
We introduce a novel winning condition for infinite two-player games on graphs which extends the request-response condition and better matches concrete applications in scheduling or project planning. In a poset game, a request has to be responded by multiple events in an ordering over time that is compatible with a given partial ordering of the events. Poset games are zero-sum, but there are pl...
متن کاملWinning strategies for aperiodic subtraction games
We provide a winning strategy for sums of games of Mark-t, an impartial game played on the nonnegative integers where each move consists of subtraction by an integer between 1 and t − 1 inclusive, or division by t, rounding down when necessary. Our algorithm computes the Sprague-Grundy values for arbitrary n in quadratic time. This addresses one of the directions of further study proposed by Av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Trends journal of sciences research
سال: 2022
ISSN: ['2377-8083', '2377-8091']
DOI: https://doi.org/10.31586/jml.2022.496