|
Volume III
The Game of Nim
By Michael J. Reske
Abstract:
We give a provably winnable strategy in the game of nim.
Successive Sets
and Nim-Sequences
By Scott C. Reske
Abstract:
We look at subtraction games, and more specifically, at successive
sets in subtraction games, looking for ways to predict the nim-sequences for
them. In
doing so, we determine tat the nim-sequence for any successive set {s1,s2,s3,…,sk}
begins with s1 zeros, followed by s1 ones,
followed by s1 twos, ad so on until we reach the term s1+sk
of the sequence.
Breaking Chairs
By Brian M. Nach
Abstract: We
will determine a winning strategy for the game COUPLES by showing that it is
equivalent to a game in which a winning strategy has been determined in the book
Winning Ways.
Population
Migration and Equilibrium Populations
By Tomislav Galac
Abstract: Beginning
with a simple case of migration of population between two states, we proceed to
analyze the more general case of n states with free population flow among them.
We find that, assuming constant migration rates, the population in the
states will reach an equilibrium point at which the yearly migration will stop
affecting the population of any single state.
Reach Out and
Touch Someone:
A Mathematical Look at Connectivity
By Shawn Chiappetta
Abstract: Given
incidence matrices of n-chains or 2-by-n ladders, we find that
there is a special eigenvector found by an “easy-to-compute” method.
We also find that the eigenvectors of n-chains and 2-by-n
ladders are very similar.
| 
