Published March 13, 2007 | Version v1

The Sequential Join of Combinatorial Games

Authors/Creators

Description

We study the sequential join of combinatorial games, and show that all combinatorial games form a monoid under this operation. We also show how this can be used to study games such as Childish Hackenbush and a new variant of normal play Hackenbush.

Files

hg3.pdf

Files (227.2 kB)

Name Size Download all
md5:7170ba838c1176bd326e445984d82aa3
227.2 kB Preview Download