A number of Nim-like games in which moves are restricted somehow to occur from a single pile are analysed. In each case the complete description of type P and type N positions is obtained. A more detailed analysis of the Sprague-Grundy values of positions in two heap Nim where the move must be from the larger heap is also presented
We study Nim with the additional rule that each player can put a constraint on the next player’s mov...
We study a version of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the follo...
The purpose of this paper is to solve a special class of combinational games consisting of two-pile ...
This paper presents a study of restricted Nim with a pass. In the restricted Nim considered in this ...
We introduce and study a generalization of the two players Nim Game involving one heap. Starting fro...
The P positions of both two-heap Nim and Wythoff’s game are easy to describe, more so in the former ...
International audienceThe P positions of both two-heap Nim and Wythoff's games are easy to describe,...
The solutions of certain combinatorial games are of a particularly nice form. For the games we shall...
NIM is a game in which two players take turns removing tokens from piles. There are usually several...
In [4] we proved a generalization of Beatty’s Theorem which we stated came from the Nim value analys...
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the fol...
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2- pile Nim but with the fo...
Richard Guy [5] asks whether the game-theoretic value *2, the value of a nim-heap of size 2, occurs ...
Richard Guy [5] asks whether the game-theoretic value *2, the value of a nim-heap of size 2, occurs ...
This paper solves a class of combinatorial games consisting of one-pile counter pickup games for wh...
We study Nim with the additional rule that each player can put a constraint on the next player’s mov...
We study a version of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the follo...
The purpose of this paper is to solve a special class of combinational games consisting of two-pile ...
This paper presents a study of restricted Nim with a pass. In the restricted Nim considered in this ...
We introduce and study a generalization of the two players Nim Game involving one heap. Starting fro...
The P positions of both two-heap Nim and Wythoff’s game are easy to describe, more so in the former ...
International audienceThe P positions of both two-heap Nim and Wythoff's games are easy to describe,...
The solutions of certain combinatorial games are of a particularly nice form. For the games we shall...
NIM is a game in which two players take turns removing tokens from piles. There are usually several...
In [4] we proved a generalization of Beatty’s Theorem which we stated came from the Nim value analys...
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the fol...
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2- pile Nim but with the fo...
Richard Guy [5] asks whether the game-theoretic value *2, the value of a nim-heap of size 2, occurs ...
Richard Guy [5] asks whether the game-theoretic value *2, the value of a nim-heap of size 2, occurs ...
This paper solves a class of combinatorial games consisting of one-pile counter pickup games for wh...
We study Nim with the additional rule that each player can put a constraint on the next player’s mov...
We study a version of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the follo...
The purpose of this paper is to solve a special class of combinational games consisting of two-pile ...
DOI
Add to ORKG