These are solutions to problems in
*The
Dots-and-Boxes Game* by Elwyn Berlekamp (A. K. Peters, 2000).
The numbers in the displayed positions are the resulting score with best
play if the player on the move
selects the corresponding line. Positive numbers are wins for the
first player to move (player A); negative numbers are wins for
the second player to move (player B).
If you have a position you'd
like analyzed
(or an analysis you'd like taken deeper), send me
an e-mail message at:
dwilson@cae.wisc.edu
The analysis programs are available if you
want to run your own analyses.

- Previously unsolved problems from chapter 12
- Problem 12.1 (p. 117)
- Problem 12.2 (p. 118)
- Problem 12.3 (p. 118)
- Problem 12.4 (p. 119)
- Problem 12.5 (p. 119)
- Problem 12.6 (p. 119)
- Problem 12.7 (p. 120)
- Problem 12.8 (p. 120)
- Problem 12.9 (p. 120)
- Problem 12.10 (p. 121)
- Problem 12.11 (p. 121)
- Problem 12.12 (p. 121)
- Problem 12.13 (p. 122)
- Problem 12.14 (p. 122)
- Problem 12.15 (p. 123)
- Problem 12.16 (p. 123)
- Problem 12.17 (p. 123)
- Problem 12.18 (p. 124)
- Problem 12.19 (p. 124)

- Previously solved problems
- from chapter 3, interesting results for 3.14 and 3.15
- from chapter 5, interesting results for 5.3, 5.14 and 5.17
- from chapter 6
- from chapter 7, interesting results for 7.6 and 7.7
- from chapter 9
- from chapter 11, interesting results for 11.6, 11.10, 11.16, 11.22 and 11.23

David Wilson / dwilson@cae.wisc.edu