相关论文: Group Actions on Winning Games of Super Tic-Tac-To…
Ultimate Tic-Tac-Toe is a variant of the well known tic-tac-toe (noughts and crosses) board game. Two players compete to win three aligned "fields", each of them being a tic-tac-toe game. Each move determines which field the next player…
We analyze misere play of impartial tic-tac-toe---a game suggested by Bob Koca in which both players make X's on the board, and the first player to complete three-in-a-row loses. This game was recently discussed on mathoverflow.net in a…
A positional game is a game where two players sequentially label vertices of a hypergraph, consisting of a board and a collection of winning sets, with colors assigned to each player until all vertices of the board are claimed. The first…
Simple board games, like Tic-Tac-Toe and CONNECT-4, play an important role not only in the development of mathematical and logical skills, but also in the emotional and social development. In this paper, we address the problem of generating…
The main challenge of combinatorial game theory is to handle combinatorial chaos, if one player knows the strategy better than his opponent, he is able to determine the exact results of a game. If both players are qualified competitor, the…
In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum…
Ultimate Tic-Tac-Toe is a variant of the popular Tic-Tac-Toe game. Two players compete to win three aligned "fields," with each field constituting its own miniature tic-tac-toe game. Each move determines which field the next player must…
Tic Tac Toe is amongst the most well-known games. It has already been shown that it is a biased game, giving more chances to win for the first player leaving only a draw or a loss as possibilities for the opponent, assuming both the players…
In the natural generalization of tic-tac-toe to an $n \times n \times n$ board where $n \in \mathbb{N}$, it is known that the first player has a winning strategy if $n \leq 4$ and that either player can force a draw if $n \geq 8$. The…
Tic-Tac-Toe game can be played by two players where the square block (3 x 3) can be filled with a cross (X) or a circle (O). The game will toggle between the players by giving the chance for each player to mark their move. When one of the…
SOS is a game similar to tic-tac-toe. We study a variety of variations of it played on a 1-by-$n$ rectangle. On our journey we change the target string to SOO, then study all target strings containing SSS, then go back to finite strings and…
We consider playing the game of Tic-Tac-Toe on block designs BIBD($v, k, \lambda$) and transversal designs TD($k, n$). Players take turns choosing points and the first player to complete a block wins the game. We show that triple systems,…
The game of tic-tac-toe is well known. In particular, in its classic version it is famous for being unwinnable by either player. While classically it is played on a grid, it is natural to consider the effect of playing the game on richer…
Game extension is an entertaining activity that offers an opportunity to test new design approaches by non-programmers. The real challenge is to enable this activity by means of a suitable infrastructure. We propose a knowledge-driven…
We study variations on combinatorial games in which, instead of alternating moves, the players bid with discrete bidding chips for the right to determine who moves next. We consider both symmetric and partisan games, and explore differences…
This paper presents the design of a cooperative multi-player betting game, Trust-ya, as a model of some elements of status processes in human groups. The game is designed to elicit status-driven leader-follower behaviours as a means to…
We propose a generalization of positional games, supplementing them with a restriction on the order in which the elements of the board are allowed to be claimed. We introduce poset positional games, which are positional games with an…
In this paper we introduce a qualitative decision and game theory based on belief (B) and desire (D) rules. We show that a group of agents acts as if it is maximizing achieved joint goals.
In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner of the game. Such games are central in formal methods since they model the interaction between a…
Autism spectrum disorder is a neurodevelopmental condition that includes issues with communication and social interactions. People with ASD also often have restricted interests and repetitive behaviors. In this paper we build preliminary…