Intereting Posts

RSA when N=pq and p = q
Finding the adjoint for a diagonal operator in $\ell^2$.
If $p:E\to B$ is a covering space and $p^{-1}(x)$ is finite for all $x \in B$, show that $E$ is compact and Hausdorff iff $B$ is compact and Hausdorff
Let $S:U\rightarrow V, \ T:V\rightarrow W$ and if $S$ and $T$ are both injective/surjective, is $TS$ injective/surjective?
Base-b Representation of an Integer: Why can I make the assumption about number of terms in expansions in uniqueness part?
To fast invert a real symmetric positive definite matrix that is almost similar to Toeplitz
Probability distribution for the position of a biased random walker on the positive integers
Proof of the square root inequality $2\sqrt{n+1}-2\sqrt{n}<\frac{1}{\sqrt{n}}<2\sqrt{n}-2\sqrt{n-1}$
Do men or women have more brothers?
function in $L_2$ space that is $f=0$ almost everywhere
Mean value theorem inside the Expectation
What does it mean that we can diagonalize the metric tensor
Adjoint of an operator on $L^2$
Fractions with numerator and denominator both odd
Decomposition of a prime number $p \neq l$ in the quadratic subfield of a cyclotomic number field of an odd prime order $l$

What is a good reference material for elementary combinatorial game theory?

By *combinatorial game theory* I mean chiefly the study of zero-sum, deterministic two-player games (perhaps even more adjectives could be added), with a view to determining which of the players has the winning strategy, and perhaps determining the strategy where possible. Example games that fall under this heading are Nim, Hex, and nearly everything that might appear as a “game” at a mathematics contest.

By *elementary* I mean not going deep into a general theory, but rather exposing some elegant and accessible examples and ideas. For instance, the discussion of winning strategy for Nim, and the idea of strategy-stealing are topics that I would find welcome.

- Counting all possible board positions in Quoridor
- Winning strategy in $(2n+1) \times (2n+1)$ matrix game.
- Converting a Gomoku winning strategy from a small board to a winning strategy on a larger board
- Winning strategies in multidimensional tic-tac-toe
- Optimal strategy for this Nim generalisation?
- Name for a certain “product game”

The request arises from the need to clear up some terminology and find additional examples for a talk that I am to give. Many thanks for all your help.

- How many ways to divide group of 12 people into 2 groups of 3 people and 3 groups of 2 people?
- A formula for heads and tail sequences
- Show that the number or $r$ combinations of $X$ which contain no consecutive integers is given by $\binom{n-r+1}{r}$
- Solutions to Binary Equations
- Number of cyclic paths in a rectangular grid?
- Maximum board position in 2048 game
- How many bins do random numbers fill?
- Does this explanation of derangements on Wikipedia make sense?
- Kings on a chessboard
- Taking seats on a plane: probability that the last two persons take their proper seats

There are several standard texts. You may want to start with a short essay, “The History of Combinatorial Game Theory”, by Richard J. Nowakowski. The paper lists the main texts you may want to consult. For a more exhaustive list of references, see “Combinatorial games: Selected bibliography with a succinct GourmetIntroduction”, by Aviezri Fraenkel. Thomas Ferguson, at UCLA, has an online book on game theory, and its first chapter is on combinatorial games.

The absolute minimum is “On Numbers and Games” by Conway, and “Winning Ways for your mathematical plays”, by Berlekamp, Conway, and Guy. “On numbers and games” develops the general theoretical framework, so it is perhaps not what you want to look at first; “Winning ways” has many examples and treats some in large amount of detail. For completeness, let me add “Fair Game: How to Play Impartial Combinatorial Games”, by Richard K. Guy.

Berlekamp has at two books on specific games, which you may want to look at if you are more interested in specific examples than the general theory: “The Dots and Boxes Game: Sophisticated Child’s Play”, and “Mathematical Go: Chilling Gets the Last Point”.

For a more advanced treatment of some subjects, see also “Games of no chance”, edited by Nowakowski. You can download several of the articles in the collection at the link. The collection includes research papers, dealing with theoretical results, but also considers specific games, connections with other fields (including economics and set theory), and includes several accessible surveys. This book is the first of a series: We also have “More games of no chance”, and “Games of no chance. 3”.

A very recent work that I like very much is “Combinatorial games. Tic-Tac-Toe theory”, by Beck. As Beck explains, the book begins to address some of the games that the theory of “Winning games” falls a bit short of; though several examples are treated in detail, the emphasis is on the general theory.

There is also a nice recent book, “Lessons in Play: An Introduction to Combinatorial Game Theory”, by Albert, Nowakowski, and Wolfe. I have seen it recommended in many places, and I agree that it is excellent.

Very recently, Aaron Siegel has developed the theory of Misere games, and he has written a book on the subject that has just appeared, “Combinatorial game theory”. He is responsible for the website “Combinatorial game suite”.

You may want to also look at this MO question (though it does not restrict to the combinatorial side) and to this one (which is strictly about combinatorial game theory).

Thanks to user Mark S. for suggesting that last link. By the way, Mark has a blog on precisely this topic, that also provides quite a few useful links.

This PDF might be a useful starting point. It also mentions a book *Fair Game: How to Play Impartial Combinatorial Games*, by Richard K. Guy. I’ve not seen it, but it was published by COMAP; the combination of author and publisher suggests that it might be well worth looking into. (There is of course the massive *Winning Ways*, by Berlekamp, Conway, & Guy, but I suspect that you’re aware of it, and in any case it’s likely to be overkill for your purposes.)

*Winning Ways: For Your Mathematical Plays* by Berlekamp, Conway, and Guy, is encyclopedic, and covers all the topics you mentioned, and many more.

- Self-study Real analysis Tao or Rudin?
- What does it mean for a function to be a solution of a differential equation?
- Need help understanding a lift of a vector field
- How does nested notation work?
- Every $n$-ary logical connective has a DNF
- The equivalence of definitions Riemann integral
- A game on a graph
- Topological manifolds (dimension)
- Determining stability of ODE
- If $f$ is continuous, nonnegative on $$, show that $\int_{a}^{b} f(x) d(x) = 0$ iff $f(x) = 0$
- Proving $\sqrt 3$ is irrational.
- Use the definition of “topologically conjugate” to prove that $F(x)=4x^3-3x$ is chaotic.
- $f(x^2) = xf(x)$ implies that $ f(x) = mx$?
- How to efficiently find the largest perfect square dividing a given large integer?
- Computational complexity of least square regression operation