Introduction to the Prisoners Versus Guards Game

Details Introduction to the Prisoners Versus Guards Game Introduction to the Prisoners Versus Guards Game

2008-01-06

arxiv.org/abs/0801.0833v1

Mathematics

Combinatorics

15 pages, 1 figure

Scientific paper

We introduce a two-player game in which one and his/her opponent attempt to pack as many ``prisoners'' as possible on the squares of an n-by-n checkerboard; each prisoner has to be ``protected'' by at least as many guards as the number of the other prisoners adjacent. Initially, the board is covered entirely with guards. The players take turns adjusting the board configuration using one of the following rules in each turn: I. Replace one guard with a prisoner of the player's color. II. Replace one prisoner of either color with a guard and replace two other guards with prisoners of the player's color. We analyze winning strategies for small n (n<5) and the maximum number of prisoners in general. We show that this maximum is less than (7n^2+4n)/11 and conjecture it is more likely 3n^2/5+O(n).

Affiliated with

Also associated with

No associations

Rating

Introduction to the Prisoners Versus Guards Game does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Introduction to the Prisoners Versus Guards Game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Introduction to the Prisoners Versus Guards Game will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-506740