The recycled Kaplansky's game

Authors:
András Pluhár
Affiliations:
Department of Computer Science, University of Szeged, Árpád tér 2, H-6720 Szeged, Hungary
Venue:
Acta Cybernetica
Year:
2004

Citing 3
Cited 0

Generalized Harary games

Acta Cybernetica
The accelerated k-in-a-row game

Theoretical Computer Science
Crossing Numbers and Hard Erdös Problems in Discrete Geometry

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by the Nine Men Morris game, the achievement or hypergraph games can be prolonged in the following way. After placing a prescribed number of stones, the players pick some of these up and replace again. We study the effect of this recycling for the k-in-a-row game and some versions of the Kaplansky's game.