English
Related papers

Related papers: Variants of Wythoff's Games with Different Termina…

200 papers

In this paper, we study a variant of the classical Wythoff's game. The classical form is played with two piles of stones, from which two players take turns to remove stones from one or both piles. When removing stones from both piles, an…

Combinatorics · Mathematics 2026-05-04 Kahori Komaki , Ryohei Miyadera , Aoi Murakami

This paper describes Wythoff's game with a pass, which is a variant of the classical Wythoff's game. The classical form is played with two piles of stones, from which two players take turns to remove stones from one or both piles. When…

Combinatorics · Mathematics 2025-07-08 Ryohei Miyadera , Hikaru Manabe , Masanori Fukui

Wythoff's Nim is a variant of 2-pile Nim in which players are allowed to take any positive number of stones from pile 1, or any positive number of stones from pile 2, or the same positive number from both piles. The player who makes the…

Combinatorics · Mathematics 2024-08-08 Mirabel Hu , Daniel Sleator , William Tsin

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…

Combinatorics · Mathematics 2016-06-23 Alex Meadows , Brad Putman

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…

Combinatorics · Mathematics 2010-10-29 Urban Larsson

We introduce a variant of Wythoff's Game that we call $m$-Modular Wythoff's Game. In the original Wythoff's Game, players can take a positive number of tokens from one pile, or they can take a positive number of tokens from both piles if…

Combinatorics · Mathematics 2024-02-22 Tanya Khovanova , Shuheng Niu

We study impartial take away games on 2 unordered piles of finite nonnegative numbers of tokens $(x,y)$. Two players alternate in removing at least one and at most all tokens from the respective piles, according to certain rules, and the…

Combinatorics · Mathematics 2012-06-21 Urban Larsson

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…

Combinatorics · Mathematics 2012-03-12 Nhan Bao Ho

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…

Combinatorics · Mathematics 2012-03-26 Nhan Bao Ho

Wythoff's Game is a variation of Nim in which players may take an equal number of stones from each pile or make valid Nim moves. W. A. Wythoff proved that the set of P-Positions (losing position), $C$, for Wythoff's Game is given by $C :=…

Combinatorics · Mathematics 2017-02-16 Shubham Aggarwal , Jared Geller , Shuvom Sadhuka , Max Yu

The authors introduce the impartial game of the generalized Ry\=u\=o Nim, a variant of the classical game of Wythoff Nim. In the latter game, two players take turns in moving a single queen on a large chessboard, attempting to be the first…

Combinatorics · Mathematics 2017-11-07 Ryohei Miyadera , Yuki Tokuni , Yushi Nakaya , Masanori Fukui , Tomoaki Abuku , Koki Suetsugu

We show that the winning positions of a certain type of two-player game form interesting patterns which often defy analysis, yet can be computed by a cellular automaton. The game, known as {\em Blocking Wythoff Nim}, consists of moving a…

Combinatorics · Mathematics 2015-06-05 Matthew Cook , Urban Larsson , Turlough Neary

We show how the software Walnut can be used to obtain concise proofs of results concerning variants of the famous Wythoff game, in which blocking maneuvers or terminal positions are added, as discussed respectively by Larsson (2011) and…

Discrete Mathematics · Computer Science 2025-12-15 Antoine Renard , Michel Rigo

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…

Combinatorics · Mathematics 2014-03-12 Aviezri S. Fraenkel , Nhan Bao Ho

Given $k\ge 3$ heaps of tokens. The moves of the 2-player game introduced here are to either take a positive number of tokens from at most $k-1$ heaps, or to remove the {\sl same} positive number of tokens from all the $k$ heaps. We analyse…

Combinatorics · Mathematics 2007-05-23 Aviezri S. Fraenkel , Dmitri Zusman

Wythoff Nim aka Corner the Lady is a classic combinatorial game. A Queen is placed on an infinite chess board and two players take alternate turns, moving the Queen closer to the corner. The first player that corners the Queen wins. What…

Combinatorics · Mathematics 2022-12-09 Robbert Fokkink , Gerard Francis Ortega , Dan Rust

In this paper we study a family of 2-pile Take Away games, that we denote by Generalized Diagonal Wythoff Nim (GDWN). The story begins with 2-pile Nim whose sets of options and $P$-positions are $\{\{0,t\}\mid t\in \N\}$ and $\{(t,t)\mid…

Combinatorics · Mathematics 2010-05-11 Urban Larsson

New combinatorial games are introduced, of which the most pertinent is Maharaja Nim. The rules extend those of the well-known impartial game of Wythoff Nim in which two players take turn in moving a single Queen of Chess on a large board,…

Combinatorics · Mathematics 2012-07-04 Urban Larsson , Johan Wästlund

Here, we present a variant of Nim with two piles. In the first pile, we have stones with a weight of 1, and in the second pile, we have stones with a weight of -2. Two Players take turns to take stones from one of the piles, and the total…

Combinatorics · Mathematics 2023-12-06 Shoei Takahashi , Hikaru Manabe , Aoi Murakami , Ryohei Miyadera

Here, we present a variant of the sliding coins game. Two coins are placed on distinct squares of a semi-infinite linear board with squares numbered $0, 1, 2, dots, $. Two players take turns and move a coin to a lower unoccupied square.…

Combinatorics · Mathematics 2025-04-29 Ryohei Miyadera , Hikaru Manabe , Unchon Lee
‹ Prev 1 2 3 10 Next ›