Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game

Details Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game

2011-07-25

arxiv.org/abs/1107.5092v1

Mathematics

Combinatorics

too many pages, undergrad honors senior thesis for the University of Washington, preliminary version

Scientific paper

We begin by reviewing and proving the basic facts of combinatorial game theory. We then consider scoring games (also known as Milnor games or positional games), focusing on the "fixed-length" games for which all sequences of play terminate after the same number of moves. The theory of fixed-length scoring games is shown to have properties similar to the theory of loopy combinatorial games, with operations similar to onsides and offsides. We give a complete description of the structure of fixed-length scoring games in terms of the class of short partizan games. We also consider fixed-length scoring games taking values in the two-element boolean algebra, and classify these games up to indistinguishability. We then apply these results to analyze some positions in the knotting-unknotting game of Pechenik, Townsend, Henrich, MacNaughton, and Silversmith.

Affiliated with

Also associated with

No associations

Rating

Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot 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 Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial Game Theory, Well-Tempered Scoring Games, and a Knot Game will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-92839