| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9514547 | Electronic Notes in Discrete Mathematics | 2005 | 6 Pages |
Abstract
Derived from the game of Nim, we present well-known Wythoff's game as a special case of two “larger” types of combinatorial games:
- The domination game. We explain that lots of combinatorial games can be con sidered as domination games on a specific graph (called the move-graph).
- The three-vectors game. It has been constructed as a geometrical extension of Wythoff's game. We give the sets of losing positions of this game in several cases.
- The domination game. We explain that lots of combinatorial games can be con sidered as domination games on a specific graph (called the move-graph).
- The three-vectors game. It has been constructed as a geometrical extension of Wythoff's game. We give the sets of losing positions of this game in several cases.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Eric Duchêne, Sylvain Gravier, Mehdi Mhalla,