✦ LIBER ✦

A Nim game played on graphs

✍ Scribed by Masahiko Fukuyama

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 262 KB
Volume: 304
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(03)00292-5

No coin nor oath required. For personal study only.

✦ Synopsis

We propose a new impartial game played by two players, which can be compared to the well-known Nim game (Winning Ways

📜 SIMILAR VOLUMES

A Nim game played on graphs II

✍ Masahiko Fukuyama 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 351 KB

Note on a pursuit game played on graphs

✍ Thomas Andreae 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 337 KB

A game of cops and robbers played on pro

A game of cops and robbers played on products of graphs

✍ S. Neufeld; R. Nowakowski 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 825 KB

The game of cops and robbers is played with a set of 'cops' and a 'robber' who occupy some vertices of a graph. Both sides have perfect information and they move alternately to adjacent vertices. The robber is captured if at least one of the cops occupies the same vertex as the robber. The problem i

On a pursuit game played on graphs for w

On a pursuit game played on graphs for which a minor is excluded

✍ Thomas Andreae 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 616 KB

A short note about pursuit games played

A short note about pursuit games played on a graph with a given genus

✍ A Quilliot 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 174 KB

Combinatorial games on a graph

✍ Claude Berge 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Survey of various problems about combinatorial games. ## O. Introduction A combinatorial game is the situation where two players, usually called A and B, play alternately by selecting an element in a finite set X according to fixed rules; the first player to achieve a certain configuration has wo