arXiv 1606.047792016-06-14math.CO

Group Actions on Winning Games of Super Tic-Tac-Toe

Whitney George, Janine E. Janoski

英文摘要：

Consider a $n \times n$ tic-tac-toe board. In each field of the board, draw a smaller $n\times n$ tic-tac-toe board. Now let super tic-tac-toe (STTT) be a game where each player's move dictates which field on the larger board a player must make their next move. We will play an impartial game of STTT where each player uses X. We define a set of actions on a game board which gives rise to a group-action on the game that creates equivalent games. We will discuss how the structure of this group-action forms a Dihedral group.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Notakto的秘密：在X-only井字游戏中获胜

The Secrets of Notakto: Winning at X-only Tic-Tac-Toe

我们分析了公平的井字游戏-一个由鲍勃·科卡建议的游戏，在这个游戏中，两个玩家都在棋盘上做X，第一个完成连续三个的玩家输了。这个游戏最近在mathoverflow.net上由Timothy Y.周梁淑

2013-01-08math.CO

Tic-Tac-Toe on an Affine Plane of order 4

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 structures, such as finite planes. Playing the game of tic-tac-toe on finite affine and projective planes has been studied previously. While the second player can usually force a draw, for small orders it is possible for the first player to win. In this regard, a computer proof that tic-tac-toe played on the affine plane of order 4 is a first player win has be…

2022-01-20math.CO

立方体井字棋：一种基于匹配的方法

Cubic tic-tac-toe: A matching-based approach

本文证明在7×7×7立方体井字棋中先手无必胜策略，通过将问题转化为二分图最大匹配，并利用Hopcroft-Karp算法辅助证明。

2025-09-25math.CO

设计上的井字棋

Tic-Tac-Toe on Designs

本文研究了在区组设计和横截设计上的井字棋及其弱版本 Maker-Breaker 游戏，证明了第一或第二玩家在不同参数条件下的必胜策略。

2024-02-16math.CO

多方向井字棋的几乎最优配对策略

Almost optimal pairing strategy for Tic-Tac-Toe with numerous directions

我们发现，有一个$m=2n+o(n)$，这样，在制造商-断路器游戏发挥$\Z^d$在制造商需要把至少$m$他的标记连续在一个$n$给定的获胜方向，断路器可以迫使平局使用配对策略。这改进了Kruczek和Sundberg的结果，他们表明，如果$m\ge 3n$，则存在这样的配对策略。一个简单的论点表明，$m$必须至少是$2n+1$，如果断路器只允许使用配对策略，因此我们的界的主要条款是最优的。

2010-05-29math.COmath.NT

有限仿射空间上的井字棋阈值

Thresholds for Tic-Tac-Toe on Finite Affine Spaces

University of South Florida（南佛罗里达大学）；Università degli Studi di Napoli Federico II（那不勒斯费德里科二世大学）

本文研究有限仿射空间上的井字棋变体，通过策略窃取和阻塞集解释证明存在阈值T(n,q)，并利用Graham-Leeb-Rothschild定理证明阈值有限，给出二进制情况的上界2^{n+1}及若干小情况的具体值。

2026-05-22math.CO

更多相关论文收起更多论文

一类对偶为伪模的秩4非代数拟阵

A family of rank $4$ non-algebraic matroids with pseudomodular dual

针对Tic-Tac-Toe拟阵曾被视作对偶非代数的代数拟阵候选例的背景，本文构造了一类具备伪模、对偶非代数性质的无限拟阵族，推广了该拟阵。

2025-11-13math.CO

螺旋、井字棋划分与深对角映射

Spirals, Tic-Tac-Toe Partition, and Deep Diagonal Maps

本研究推广五角星映射提出深对角映射$T_k$，证明其保持α、β型$k$-螺旋不变，推导$T_3$有理公式与四个代数不变量，揭示其轨道的井字棋网格划分结构，完善了映射的几何推广理论。

2025-07-30math.COmath.DS

障碍、斜坡与井字棋：离散几何与组合对策论之旅

Obstacles, Slopes, and Tic-Tac-Toe: An excursion in discrete geometry and combinatorial game theory

如果$G$的顶点由平面中的不同点表示，并且每条边由连接相应的顶点对并且不穿过$G$的任何其他顶点的直线段表示，则图的绘图被称为{ \em直线绘图}。$G$的直线图中的最小斜率数称为$G$的斜率数。我们证明了每一个三次图都可以只用四个基本斜率$\{0,π/4,π/2,-π/4\}$在平面上画出直线边。我们还证明了四个斜率具有这个性质当且仅当我们可以用它们画出$K_4$。给定图$G$，$G$的{ \em障碍表示}是表示$G$的顶点的平面中的点的集合，连同障碍（连接的多边形）的集合，使得$G$的两个顶点通过边连接，当且仅当对应的点可以通过避开所有障碍的线段连接。$G$的{ \em障碍数}是$G$的障碍表示中障碍的最小数目。证明了$n$顶点上存在障碍数为$Ω({n}/{\log n})$的图.我们发现，有一个$m=2n+o(n)$，这样，在制造商-断路器游戏发挥$\Z^d$在制造商需要把至少$m$他的标记连续在$n$给定的获胜方向，断路器可以迫使平局使用配对策略。这改进了Kruczek和Sundberg的结果，他们表明如果是$m\ge 3n$，则存在这样的配对策略。一个简单的论证表明，如果只允许Breaker使用配对策略，则$m$必须至少为$2n+1$，因此我们的界的主项是最优的。

2011-09-01cs.DMmath.CO

Eternal Picaria

Picaria is a traditional board game, played by the Zuni tribe of the American Southwest and other parts of the world, such as a rural Southwest region in Sweden. It is related to the popular children's game of Tic-tac-toe, but the 2 players have only 3 stones each, and in the second phase of the game, pieces are slided, along specified move edges, in attempts to create the three-in-a-row. We provide a rigorous solution, and prove that the game is a draw; moreover our solution gives insights to strategies that players can use.

2016-07-17math.CO

Restricted Positional Games

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 player to claim all elements of a winning set wins. If no player claims all the elements of a winning set, then the game results in a draw. One such example of a positional game is Tic-Tac-Toe, where the board is the 3-by-3 grid. The popular game of Connect-4 is an example of what we define to be a "restricted positional game". Here, we introduce another examp…

2021-08-29math.CO