## Virus Versus Mankind (2000)

Venue: | Proc. 2nd Intern. Conference on Computers and Games CG'2000 |

Citations: | 3 - 1 self |

### BibTeX

@INPROCEEDINGS{Fraenkel00virusversus,

author = {Aviezri S. Fraenkel},

title = {Virus Versus Mankind},

booktitle = {Proc. 2nd Intern. Conference on Computers and Games CG'2000},

year = {2000},

pages = {204--213},

publisher = {Springer}

}

### OpenURL

### Abstract

We define a two-player virus game played on a finite cyclic digraph G = (V; E). Each vertex is either occupied by a virus, or is unoccupied. A move consists of moving a virus from some u into a selected neighborhood N(u) of u, while devouring every virus in N(u), and replicating in N(u), i.e., placing a virus on all vertices of N(u) where there wasn't any virus. The player first killing all the virus wins, and the opponent loses. If there is no last move, the outcome is a draw. Giving a minimum of the underlying theory, we exhibit the nature of the games on hand of examples. The 3-fold motivation for exploring these games stems from complexity considerations in combinatorial game theory, extending the hitherto 0player and solitaire cellular automata games to two-player games, and the theory of linear error correcting codes. Keywords: two-player cellular automata games, generalized SpragueGrundy function 1 Introduction The virus is engaged mainly in the following two acti...

### Citations

251 |
On numbers and games
- Conway
- 1976
(Show Context)
Citation Context ...ch has no follower labeled i, put `(u) / 1. 4. (Increase label.) If Vs6= ;, put i / i + 1 and return to 2; otherwise end. We then have fl(u) = `(u). The fl function has been defined in [22]. See also =-=[4]-=-, Ch. 11. The above algorithm is a simplified version of Algorithm G in [16]. Informally, a P -position is any position u from which the Previous player can force a win, that is, the opponent of the p... |

51 | Chip-firing and the critical group of a graph - Biggs - 1999 |

26 |
On the computational complexity of finite cellular automata
- Sutner
- 1995
(Show Context)
Citation Context ...by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in [18], [20], [23], [24], [25], [26], =-=[27]-=-. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to two-player games in a natural way, a... |

16 |
Misère annihilation games
- Ferguson
- 1984
(Show Context)
Citation Context ...occupied. Two tokens are mutually annihilated on impact, hence the name. Mis`ere play (in which the player making the last move loses, and the opponent wins) of annihilation games was investigated in =-=[7]-=-. Our motivation for examining annihilation games, suggested to us by John Conway, was to create games which exhibit some interaction between tokens and yet still have a polynomial strategy. Annihilat... |

16 | Chip firing and the Tutte polynomial - López |

14 |
Integral lexicographic codes
- Conway
- 1990
(Show Context)
Citation Context ...exity of q-regular games is O(jV j 3q+2 ), which is a polynomial of high degree. For very large codes, the computation is shorter than the exponential computation implied by the lexicodes method [6], =-=[5]-=-, [21]. In practice, the computation of V 0 , which is all that's needed for the codes, can often be done by inspection. The best codes are derived from a digraph which is a simplification of that of ... |

11 |
PSPACE-Hardness of some combinatorial games
- Fraenkel, Goldschmidt
- 1987
(Show Context)
Citation Context ...exity is O(jV j 6 ), the polynomial computation of a winning move may require a "strategy in the broad sense" (see [10] x4) and just about any perturbation of them yields Pspace-hard games (=-=see [14], [12]-=-, [17]). They also lead to linear error correcting codes [9], but their Hamming distance iss4. The current work was motivated by the desire to create games which naturally induce codes of Hamming dist... |

9 |
Fraenkel [1996], Scenic trails ascending from sea-level Nim to alpine chess, in
- S
- 1994
(Show Context)
Citation Context ... strategy. Annihilation games are "barely" polynomial, in several senses. Their complexity is O(jV j 6 ), the polynomial computation of a winning move may require a "strategy in the bro=-=ad sense" (see [10]-=- x4) and just about any perturbation of them yields Pspace-hard games (see [14], [12], [17]). They also lead to linear error correcting codes [9], but their Hamming distance iss4. The current work was... |

9 |
Merlin’s magic square
- Pelletier
- 1987
(Show Context)
Citation Context ...nics, and Merlin Magic Square by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in [18], =-=[20]-=-, [23], [24], [25], [26], [27]. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to two-pl... |

9 |
Dance Composition
- Smith
- 1985
(Show Context)
Citation Context ...every u 2 Vswhich has no follower labeled i, put `(u) / 1. 4. (Increase label.) If Vs6= ;, put i / i + 1 and return to 2; otherwise end. We then have fl(u) = `(u). The fl function has been defined in =-=[22]-=-. See also [4], Ch. 11. The above algorithm is a simplified version of Algorithm G in [16]. Informally, a P -position is any position u from which the Previous player can force a win, that is, the opp... |

7 |
Sloane [1986], Lexicographic codes: error-correcting codes from game theory
- Conway, A
(Show Context)
Citation Context ...complexity of q-regular games is O(jV j 3q+2 ), which is a polynomial of high degree. For very large codes, the computation is shorter than the exponential computation implied by the lexicodes method =-=[6]-=-, [5], [21]. In practice, the computation of V 0 , which is all that's needed for the codes, can often be done by inspection. The best codes are derived from a digraph which is a simplification of tha... |

6 |
Guy [1982], Winning Ways for your mathematical plays (two volumes
- Berlekamp, Conway, et al.
(Show Context)
Citation Context ...i 8 \Phi 15 \Phi 16 \Phi 32 = 48. So firing y 7 and complementing y 6 and any two of the x i (i ! 7) is a winning move. Incidentally, the sequence f1; 2; 4; 8; 15; 16; 32; 51; : : :g has been used in =-=[1] for a spe-=-cial case of the game "Turning Turtles". Example 7 Play a 4-regular game on G(7), on the same initial position as in the previous example. Here any collection of x i is in V i . (More genera... |

6 |
Fraenkel [1974], Combinatorial games with an annihilation rule, in: The Influence of Computing on
- S
- 1973
(Show Context)
Citation Context ...sum of three instances of the previous games. Compute an optimal strategy for each of the four games. 7 Epilogue The special case of 1-regular games are the so-called annihilation games , analyzed in =-=[8]-=-, [13], [15]. In this setting, vertices with weight 1 are considered to 8 Figure 4: Triple Strike game. c fl 2000 be occupied by a token, and those with weight 0 are unoccupied. Two tokens are mutuall... |

6 |
Fraenkel [1996], Error-correcting codes derived from combinatorial games
- S
- 1994
(Show Context)
Citation Context ...move may require a "strategy in the broad sense" (see [10] x4) and just about any perturbation of them yields Pspace-hard games (see [14], [12], [17]). They also lead to linear error correct=-=ing codes [9]-=-, but their Hamming distance iss4. The current work was motivated by the desire to create games which naturally induce codes of Hamming distance ? 4. Virus games precisely provide such codes, a topic ... |

5 | 1992], Chip-firing on directed graphs - Bjorner, Lov'asz |

5 |
Fraenkel and Y. Yesha [1976], Theory of annihilation games
- S
(Show Context)
Citation Context ...f three instances of the previous games. Compute an optimal strategy for each of the four games. 7 Epilogue The special case of 1-regular games are the so-called annihilation games , analyzed in [8], =-=[13]-=-, [15]. In this setting, vertices with weight 1 are considered to 8 Figure 4: Triple Strike game. c fl 2000 be occupied by a token, and those with weight 0 are unoccupied. Two tokens are mutually anni... |

5 |
Fraenkel and Y. Yesha [1982], Theory of annihilation games
- S
(Show Context)
Citation Context ...e instances of the previous games. Compute an optimal strategy for each of the four games. 7 Epilogue The special case of 1-regular games are the so-called annihilation games , analyzed in [8], [13], =-=[15]-=-. In this setting, vertices with weight 1 are considered to 8 Figure 4: Triple Strike game. c fl 2000 be occupied by a token, and those with weight 0 are unoccupied. Two tokens are mutually annihilate... |

5 |
The generalized Sprague– Grundy function and its invariance under certain mappings
- Fraenkel, Yesha
(Show Context)
Citation Context ... put i / i + 1 and return to 2; otherwise end. We then have fl(u) = `(u). The fl function has been defined in [22]. See also [4], Ch. 11. The above algorithm is a simplified version of Algorithm G in =-=[16]-=-. Informally, a P -position is any position u from which the Previous player can force a win, that is, the opponent of the player moving from u. An N -position is any position v from which the Next pl... |

5 |
1991], Sand piles, combinatorial games and cellular automata
- Goles
- 1990
(Show Context)
Citation Context ...lectronics, and Merlin Magic Square by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in =-=[18]-=-, [20], [23], [24], [25], [26], [27]. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to ... |

5 |
1988], On oe-automata
- Sutner
- 1988
(Show Context)
Citation Context ...rlin Magic Square by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in [18], [20], [23], =-=[24]-=-, [25], [26], [27]. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to two-player games i... |

4 |
1989], Merlin's magic square revisited
- Stock
- 1989
(Show Context)
Citation Context ...and Merlin Magic Square by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in [18], [20], =-=[23]-=-, [24], [25], [26], [27]. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to two-player g... |

4 |
1990], The oe-game and cellular automata
- Sutner
(Show Context)
Citation Context ...quare by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in [18], [20], [23], [24], [25], =-=[26]-=-, [27]. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to two-player games in a natural ... |

3 |
Fraenkel and Y. Yesha [1979], Complexity of problems in games, graphs and algebraic equations
- S
(Show Context)
Citation Context ... complexity is O(jV j 6 ), the polynomial computation of a winning move may require a "strategy in the broad sense" (see [10] x4) and just about any perturbation of them yields Pspace-hard g=-=ames (see [14]-=-, [12], [17]). They also lead to linear error correcting codes [9], but their Hamming distance iss4. The current work was motivated by the desire to create games which naturally induce codes of Hammin... |

3 |
Reingold [1995], The complexity of pursuit on a graph, Theoret
- Goldstein, M
(Show Context)
Citation Context ...is O(jV j 6 ), the polynomial computation of a winning move may require a "strategy in the broad sense" (see [10] x4) and just about any perturbation of them yields Pspace-hard games (see [1=-=4], [12], [17]-=-). They also lead to linear error correcting codes [9], but their Hamming distance iss4. The current work was motivated by the desire to create games which naturally induce codes of Hamming distance ?... |

3 |
1989], Linear cellular automata and
- Sutner
(Show Context)
Citation Context ...agic Square by Parker Brothers (but Arthur-Merlin games are something else again). Quite a bit is known about such solitaire games. Background and theory can be found e.g., in [18], [20], [23], [24], =-=[25]-=-, [26], [27]. Incidentally, related but different solitaires are chip firing games , see e.g., [3], [19], [2]. In the present paper we have extended cellular automata games to two-player games in a na... |

1 |
Fraenkel [2000], Two-player games on cellular automata
- S
(Show Context)
Citation Context ... of F (u), for all u 2 V , in addition to complementing u, provided u is not a leaf. The emphasis here is on exhibiting examples of two-player virus games. Their theory and complexity are explored in =-=[11]-=-. 2 Initial Examples In Figures 1 and 2, the shaded vertices have weight 1, the rest have weight 0. Example 1 We play a 3-regular game on the sum of the two components G 1 , 3 G 2 of Figure 1, for whi... |