中文
相关论文

相关论文: Optimum Strategies for the Game Super Six

200 篇论文

We all have preferences when multiple choices are available. If we insist on satisfying our preferences only, we may suffer a loss due to conflicts with other people's identical selections. Such a case applies when the choice cannot be…

We study two-player games with alternating moves played on infinite trees. Our main focus is on the case where the trees are full (regular) and the winning set is open (with respect to the product topology on the tree). Gale and Stewart…

最优化与控制 · 数学 2026-02-17 Dean Kraizberg

The game of Nim, which has been well known for many years, has numerous variations. One such variation is Circular Nim, where piles of stones are arranged on a circumference, and players take stones from consecutive adjacent piles in one…

组合数学 · 数学 2024-11-13 Hiromi Oginuma , Masato Shinoda

Circular Nim is a two-player impartial combinatorial game consisting of $n$ stacks of tokens placed in a circle. A move consists of choosing $k$ consecutive stacks and taking at least one token from one or more of the stacks. The last…

组合数学 · 数学 2024-04-11 Matthieu Dufour , Silvia Heubach

In the game of $n-Sim$, two players take it in turn to claim unclaimed edges from a complete graph on $n$ vertices, with the first person to create a triangle in his own edges being the loser. We present some strategy-stealing arguments…

组合数学 · 数学 2020-01-29 Alexandru Malekshahian

Positional games are a well-studied class of combinatorial game. In their usual form, two players take turns to play moves in a set (`the board'), and certain subsets are designated as `winning': the first person to occupy such a set wins…

组合数学 · 数学 2016-07-12 J. Robert Johnson , Imre Leader , Mark Walters

We introduce a new virtual environment for simulating a card game known as "Big 2". This is a four-player game of imperfect information with a relatively complicated action space (being allowed to play 1,2,3,4 or 5 card combinations from an…

机器学习 · 计算机科学 2018-09-03 Henry Charlesworth

We define a variant of the two-dimensional Silver Dollar game. Two coins are placed on a chessboard of unbounded size, and two players take turns choosing one of the coins and moving it. Coins are to be moved to the left or upward…

综合数学 · 数学 2025-06-10 Ryohei Miyadera , Enchong Li , Akito Tsujii

Euclid is a well known two-player impartial combinatorial game. A position in Euclid is a pair of positive integers and the players move alternately by subtracting a positive integer multiple of one of the integers from the other integer…

组合数学 · 数学 2012-02-22 Grant Cairns , Nhan Bao Ho

Two players take turns claiming empty cells from an $n\times n$ grid. The first player (if any) to occupy a transversal (a set of $ n $ cells having no two cells in the same row or column) is the winner. What is the outcome of the game…

组合数学 · 数学 2025-07-08 Žarko Ranđelović

Wordle is an online word puzzle game that gained viral popularity in January 2022. The goal is to guess a hidden five letter word. After each guess, the player gains information about whether the letters they guessed are present in the…

计算与语言 · 计算机科学 2022-02-02 Benton J. Anderson , Jesse G. Meyer

The 2-player impartial game of Wythoff Nim is played on two piles of tokens. A move consists in removing any number of tokens from precisely one of the piles or the same number of tokens from both piles. The winner is the player who removes…

组合数学 · 数学 2010-10-29 Urban Larsson

We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are \emph{concurrent} in that at each turn, both players independently propose…

计算机科学中的逻辑 · 计算机科学 2019-03-14 Krishnendu Chatterjee , Thomas A. Henzinger , Vinayak S. Prabhu

We examine the problem of the existence of optimal deterministic stationary strategiesintwo-players antagonistic (zero-sum) perfect information stochastic games with finitely many states and actions.We show that the existenceof such…

计算机科学与博弈论 · 计算机科学 2016-11-28 Hugo Gimbert , Wieslaw Zielonka

We analyze the dynamics of competitions with a large number of players. In our model, n players compete against each other and the winner is decided based on the standings: in each competition, the mth ranked player wins. We solve for the…

物理与社会 · 物理学 2007-05-23 E. Ben-Naim , B. Kahng , J. S. Kim

Dice control involves "setting" the dice and then throwing them carefully, in the hope of influencing the outcomes and gaining an advantage at craps. How does one test for this ability? To specify the alternative hypothesis, we need a…

统计方法学 · 统计学 2025-12-17 Stewart N. Ethier

In simple card games, cards are dealt one at a time and the player guesses each card sequentially. We study problems where feedback (e.g. correct/incorrect) is given after each guess. For decks with repeated values (as in blackjack where…

概率论 · 数学 2021-07-20 Persi Diaconis , Ron Graham , Sam Spiro

Soccer is a sparse rewarding game: any smart or careless action in critical situations can change the result of the match. Therefore players, coaches, and scouts are all curious about the best action to be performed in critical situations,…

机器学习 · 计算机科学 2021-09-15 Pegah Rahimian , Afshin Oroojlooy , Laszlo Toka

Kiiking is an extreme sport in which athletes alternate between standing and squatting to pump a standing swing till it is inverted and completes a rotation. A minimal model of the sport may be cast in terms of the control of an actively…

科普物理 · 物理学 2023-08-16 Petur Bryde , Ian C. Davenport , L. Mahadevan

Quitting games are one of the simplest stochastic games in which at any stage each player has only two possible actions, continue and quit. The game ends as soon as at least one player chooses to quit. The players then receive a payoff,…

概率论 · 数学 2011-01-13 Katharina Fischer