A Nim-type computer game of strategy on plane is described in this paper. It is demonstrated that winning strategies of this two-person game are determined by a system of equations with two unknown integer se-quences. Properties of winning points/states are discussed and an O(loglogn) algorithm for the winning states is provided. Two varieties of the Game are also introduced and their winning strategies are analyzed
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on gra...
AbstractNimhoff designates a class of two-player perfect-information combinatorial games. Let R ⊆ (L...
We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a...
Abstract. Given a graph G with positive integer weights on the vertices, and a token placed on some ...
International audienceGiven a graph G with positive integer weights on the vertices, and a token pla...
AbstractWe propose a new impartial game played by two players, which can be compared to the well-kno...
Nim is a well-known two-player impartial combinatorial game. Various versions of playing Nim on grap...
AbstractThis paper considers the computational complexity of computing winning strategies in diophan...
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this p...
Abstract We propose a new impartial game played by two players, which can be com-pared to the well-k...
A research was conducted to study the difference between two methods used to play Nim game. The Nim ...
The solutions of certain combinatorial games are of a particularly nice form. For the games we shall...
This thesis consists of two chapters.The first chapter is about the new version of NIM recently intr...
Many players know that the secret to winning the game of Nim (and other “impartial ” combinatorial g...
Games are simple models of decisionmaking. Understanding games should help usunderstand decisions. M...
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on gra...
AbstractNimhoff designates a class of two-player perfect-information combinatorial games. Let R ⊆ (L...
We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a...
Abstract. Given a graph G with positive integer weights on the vertices, and a token placed on some ...
International audienceGiven a graph G with positive integer weights on the vertices, and a token pla...
AbstractWe propose a new impartial game played by two players, which can be compared to the well-kno...
Nim is a well-known two-player impartial combinatorial game. Various versions of playing Nim on grap...
AbstractThis paper considers the computational complexity of computing winning strategies in diophan...
An evolutionary approach for computing the winning strategy for Nim-like games is proposed in this p...
Abstract We propose a new impartial game played by two players, which can be com-pared to the well-k...
A research was conducted to study the difference between two methods used to play Nim game. The Nim ...
The solutions of certain combinatorial games are of a particularly nice form. For the games we shall...
This thesis consists of two chapters.The first chapter is about the new version of NIM recently intr...
Many players know that the secret to winning the game of Nim (and other “impartial ” combinatorial g...
Games are simple models of decisionmaking. Understanding games should help usunderstand decisions. M...
The combinatorial game of Nim can be played on graphs. Over the years, various Nim-like games on gra...
AbstractNimhoff designates a class of two-player perfect-information combinatorial games. Let R ⊆ (L...
We introduce a generalization of the classical game of Nim by placing the piles on the vertices of a...
DOI
Add to ORKG