The recycled Kaplansky's game

András Pluhár

Skip to main content Skip to main navigation menu Skip to site footer

The recycled Kaplansky's game

András Pluhár

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.

Downloads

Download data is not yet available.

PDF

Published

2004-01-01

How to Cite

Pluhár, A. (2004). The recycled Kaplansky’s game. Acta Cybernetica, 16(3), 451-458. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3635

Download Citation

Issue

Vol 16 No 3 (2004)

Section

Regular articles

Most read articles by the same author(s)

András Pluhár, Remarks on the interval number of graphs , Acta Cybernetica: Vol 12 No 2 (1995)
András Pluhár, Generalized Harary games , Acta Cybernetica: Vol 13 No 1 (1997)
András Bóta, Miklós Krész, András Pluhár, Dynamic communities and their detection , Acta Cybernetica: Vol 20 No 1 (2011)
Erika Griechisch, András Pluhár, Community detection by using the extended modularity , Acta Cybernetica: Vol 20 No 1 (2011)
András Bóta, Miklós Krész, András Pluhár, Approximations of the generalized cascade model , Acta Cybernetica: Vol 21 No 1 (2013)
András London, András Pluhár, Spanning Tree Game as Prim Would Have Played , Acta Cybernetica: Vol 23 No 3 (2018)
Geza Makay, Andras Pluhar, Linear Time Ordering of Bins using a Conveyor System , Acta Cybernetica: Vol 24 No 2 (2019): Regular papers