This collection of 22 research papers and state-of-the-art surveys extends the subseries 'Games of No Chance' pioneered in 1996. Survey topics include Richman bidding combinatorial games, classical subtraction games and absolute additive theory. Other topics discussed include extensions of normal play theory such as Absolute CGT and Affine normal play; additive theory; aspects of generic impartial games arising from the study of nim-values; dead-ending misère reduction theorems; Wythoff-type variations; complexity issues; and aspects of classical games including a rigorous justification of the celebrated result that king, bishop and knight can checkmate a lonely king on an arbitrarily large chessboard. The recurring list of open problems, updated and annotated, will interest all practitioners of CGT and related fields including algebra, computer science, combinatorics, number theory and classical game theory.

‘Games of No Chance are games with perfect information like Chess (about which chapter 15 says something new). They were pioneered by the renowned mathematicians Berlekamp, Conway and Guy. This volume demonstrates how this original and playful but serious branch of mathematics flourishes and grows.’

Bernhard von Stengel - London School of Economics and Political Science