中文
相关论文

相关论文: Relaxed Wythoff has All Beatty Solutions

200 篇论文

We prove a recent conjecture of Duch\^ene and Rigo, stating that every complementary pair of homogeneous Beatty sequences represents the solution to an \emph{invariant} impartial game. Here invariance means that each available move in a…

组合数学 · 数学 2010-05-25 Urban Larsson , Peter Hegarty , Aviezri S. Fraenkel

We study 2-player impartial games of the form take-away which produce P-positions (second player winning positions) corresponding to complementary Beatty sequences, given by the continued fractions (1;k,1,k,1,...) and (k+1;k,1,k,1,...). Our…

组合数学 · 数学 2013-02-04 Urban Larsson , Mike Weimerskirch

We determine the full nim-value structure of additive subtraction games in the {\em primitive quadratic} regime. The problem appears in Winning Ways by Berlekamp et al. in 1982; it includes a closed formula, involving Beatty-type {\em…

组合数学 · 数学 2026-03-31 Urban Larsson , Hikaru Manabe

We study the problem whether there exist variants of {\sc Wythoff}'s game whose $\P$-positions, except for a finite number, are obtained from those of {\sc Wythoff}'s game by adding a constant $k$ to each $\P$-position. We solve this…

组合数学 · 数学 2014-03-12 Aviezri S. Fraenkel , Nhan Bao Ho

Fix a positive integer $m$. The game of \emph{$m$-Wythoff Nim} (A.S. Fraenkel, 1982) is a well-known extension of \emph{Wythoff Nim}, a.k.a 'Corner the Queen'. Its set of $P$-positions may be represented by a pair of increasing sequences of…

组合数学 · 数学 2010-05-25 Urban Larsson

We give short rules for two-pile take-away games satisfying that a pair of complementary homogeneous Beatty sequences together with $(0,0)$ constitute a complete set of $P$-positions.

组合数学 · 数学 2011-03-21 Urban Larsson

This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtraction games on tuples of nonnegative integers (Golomb 1966),…

组合数学 · 数学 2024-01-17 Urban Larsson , Indrajit Saha , Makoto Yokoo

Impartial subtraction games on the nonnegative integers have been studied by many and discussed in detail in for example the remarkable work Winning Ways by Conway, Berlekamp and Guy. We describe how comply variations of these games,…

数论 · 数学 2012-09-11 Urban Larsson

Dull, weak and nested solitaire games are important classes of parity games, capturing, among others, alternation-free mu-calculus and ECTL* model checking problems. These classes can be solved in polynomial time using dedicated algorithms.…

计算机科学中的逻辑 · 计算机科学 2013-07-18 Maciej Gazda , Tim A. C. Willemse

We study 2-player impartial games, so called \emph{invariant subtraction games}, of the type, given a set of allowed moves the players take turn in moving one single piece on a large Chess board towards the position $\boldsymbol 0$. Here,…

组合数学 · 数学 2010-09-23 Urban Larsson

Wythoff's Game is a game for two players playing alternately on two stacks of tiles. On her turn, a player can either remove a positive number of tiles from one stack, or remove an equal positive number of tiles from both stacks. The last…

组合数学 · 数学 2016-06-23 Alex Meadows , Brad Putman

In this article, we study the behavior of a broad family of real sequences derived from randomized one-pile subtraction games. For any subtraction set $S$, we allow any valid number of chips $s\in S$ to be removed at equal probability at…

组合数学 · 数学 2024-05-31 Nicolas Capitelli , Francisco Somma

Duch\^ene and Rigo introduced the notion of invariance for take-away games on heaps. Roughly speaking, these are games whose rulesets do not depend on the position. Given a sequence $S$ of positive tuples of integers, the question of…

离散数学 · 计算机科学 2014-08-25 Eric Duchêne , Aline Parreau , Michel Rigo

We give new characterizations of core imputations for the following games: * The assignment game. * Concurrent games, i.e., general graph matching games having non-empty core. * The unconstrained bipartite $b$-matching game (edges can be…

计算机科学与博弈论 · 计算机科学 2023-01-02 Vijay V. Vazirani

We present two variants of Wythoff's game. The first game is a restriction of Wythoff's game in which removing tokens from the smaller pile is not allowed if the two entries are not equal. The second game is an extension of Wythoff's game…

组合数学 · 数学 2012-03-12 Nhan Bao Ho

In 1973 Fraenkel discovered interesting sequences which split the positive integers. These sequences became famous, because of a related unsolved conjecture. Here we construct combinatorial games, with `playable' rulesets, with these…

组合数学 · 数学 2017-05-24 Aviezri S. Fraenkel , Urban Larsson

Parrondo's games manifest the apparent paradox where losing strategies can be combined to win and have generated significant multidisciplinary interest in the literature. Here we review two recent approaches, based on the Fokker-Planck…

统计力学 · 物理学 2009-11-10 P. Amengual , A. Allison , R. Toral , D. Abbott

We introduce a restriction of Wythoff's game, which we call F-Wythoff, in which the integer ratio of entries must not change if an equal number of tokens are removed from both piles. We show that P-positions of F-Wythoff are exactly those…

组合数学 · 数学 2012-03-26 Nhan Bao Ho

The aim of this paper is twofold. First, we extend the results of [33] concerning the existence and uniqueness of second-order reflected 2BSDEs to the case of two obstacles. Under some regularity assumptions on one of the barriers, similar…

概率论 · 数学 2014-01-31 Anis Matoussi , Lambert Piozin , Dylan Possamaï

We formulate a notion of doubly reflected BSDE in the case where the barriers $\xi$ and $\zeta$ do not satisfy any regularity assumption and with a general filtration. Under a technical assumption (a Mokobodzki-type condition), we show…

‹ 上一页 1 2 3 10 下一页 ›