اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدThe Namer-Claimer game
85
0
0.0
(
0
)
تأليف
Ben Barber
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In each round of the Namer-Claimer game, Namer names a distance d, then Claimer claims a subset of [n] that does not contain two points that differ by d. Claimer wins once they have claimed sets covering [n]. I show that the length of this game is of order log log n with optimal play from each side.
قيم البحث
اقرأ أيضاً
We analyze a coin-based game with two players where, before starting the game, each player selects a string of length $n$ comprised of coin tosses. They alternate turns, choosing the outcome of a coin toss according to specific rules. As a result, th
e game is deterministic. The player whose string appears first wins. If neither players string occurs, then the game must be infinite. We study several aspects of this game. We show that if, after $4n-4$ turns, the game fails to cease, it must be infinite. Furthermore, we examine how a player may select their string to force a desired outcome. Finally, we describe the result of the game for particular cases.
Consider equipping an alphabet $mathcal{A}$ with a group action that partitions the set of words into equivalence classes which we call patterns. We answer standard questions for the Penneys game on patterns and show non-transitivity for the game on
patterns as the length of the pattern tends to infinity. We also analyze bounds on the pattern-based Conway leading number and expected wait time, and further explore the game under the cyclic and symmetric group actions.
In a Maker-Breaker game there are two players, Maker and Breaker, where Maker wins if they create a specified structure while Breaker wins if they prevent Maker from winning indefinitely. A $3$-AP is a sequence of three distinct integers $a, b, c$ su
ch that $b-a = c-b$. The $3$-AP game is a Maker-Breaker game played on $[n]$ where every round Breaker selects $q$ unclaimed integers for every Makers one integer. Maker is trying to select points such that they have a $3$-AP and Breaker is trying to prevent this. The main question of interest is determining the threshold bias $q^*(n)$, that is the minimum value of $q=q(n)$ for which Breaker has a winning strategy. Kusch, Rue, Spiegel and Szabo initially asked this question and proved $sqrt{n/12-1/6}leq q^*(n)leq sqrt{3n}$. We find new strategies for both Maker and Breaker which improve the existing bounds to [ (1+o(1))sqrt{frac{n}{5.6}} leq q^*(n) leq sqrt{2n} +O(1). ]
While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and
then investigate the differences between forests with game chromatic number 3 and 4. In doing so, we present a minimal example of a forest with game chromatic number 4, criteria for determining the game chromatic number of a forest without vertices of degree 3, and an example of a forest with maximum degree 3 and game chromatic number 4.
Sprouts is a two-player topological game, invented in 1967 by Michael Paterson and John Conway. The game starts with p spots drawn on a sheet of paper, and lasts at most 3p-1 moves: the player who makes the last move wins. Sprouts is a very intrica
te game and the best known manual analysis only achieved to find a winning strategy up to p=7 spots. Recent computer analysis reached up to p=32. The standard game is played on a plane, or equivalently on a sphere. In this article, we generalize and study the game on any compact surface. First, we describe the possible moves on a compact surface, and the way to implement them in a program. Then, we show that we only need to consider a finite number of surfaces to analyze the game with p spots on any compact surface: if we take a surface with a genus greater than some limit genus, then the game on this surface is equivalent to the game on some smaller surface. Finally, with computer calculation, we observe that the winning player on orientable surfaces seems to be always the same one as on a plane, whereas there are significant differences on non-orientable surfaces.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
