The goal of Hackenstrings is to make it so that your opponent has no legal move. A move consists of choosing a token of your own color and removing it from the board, along with all tokens to the right of it.

- If black moves first, who wins each of these games? What if white moves first?
- Draw the game tree for a few of these games and evaluate the corresponding trees to verify your solutions to each game. For each game you will need to make two trees, one for when black goes first and one for when white goes first.

- What is the value of the empty position? (that is, the position with no rows at all)
- Which of the games above are positive? Negative? Zero?
- Does a single-row game of Hackenstrings starting with a black token have to be positive?
- Is it ever advantageous to take a token which is not as far to the right as possible?

- What is the value of a single row of
*n*white tokens? Show your answer makes sense by proving that the game with two rows of equal length, one all white and one all black, has value zero. - Generalize your proof to show that swapping all the colors in a game of Hackenstrings multiplies the value by -1.
- Define an ordering for Hackenstrings games. That is, define what it means for one position to be greater than or equal to another. If
*A*,*B*, and*C*are Hackenstrings games and*A*is greater than*B*, is*A*+*C*always greater than*B*+*C*? - Find a game of Hackenstrings with a value of +1/2 (hint #1: two copies of the game along with a single white token must be a loss for the first player to move. hint #2: there is a game with value +1/2 that only involves one row of tokens.)
- What is the value of a black token followed by
*n*white tokens?

- Is the first game above positive or negative? Use the values of games you know to approximate its value. Once you have a guess, verify that your guess is correct.
- The second game has an infinitessimal (infinitely small) positive value. Prove this by showing that it is positive but less than 1/(2
^{n}) for every*n*. - The third game has an infinite positive value which we call
*omega*. Prove this by showing that no matter how large*n*is, adding a row of*n*white stones still gives a positive game. - What is the value of the fourth game compared to the third game?

- Hackenstrings and the 0.999... = 1 FAQ: http://www.maths.nott.ac.uk/personal/anw/Research/Hack/
- Surreal numbers in Go: http://senseis.xmp.net/?SurrealNumbers
- The game of Hackenbush: www.math.uchicago.edu/~may/ VIGRE/VIGRE2006/PAPERS/Bartlett.pdf
- Exceprt from
*On Numbers and Games*: http://books.google.com/books?id=tXiVo8qA5PQC&pg=PA188&lpg=PA188&dq=hackenbush+hotchpotch&source=web&ots=y-6GELgU8T&sig=-p6w_OyZpcCQR44UudQP7zqx4Rk

Back to index