Suppose you have an infinitely large sheet of paper (mathematicians refer to this hypothetical object as the plane). You also have a number of different colours - pots of paint, perhaps. Your aim is to colour every point on the plane using the colours available. That is, each point must be assigned one colour.
Chomp is a simple two-dimensional game, played as follows.
Cookies are set out on a rectangular grid. The bottom left cookie is poisoned.
Two players take it in turn to "chomp" - that is, to eat one of the remaining cookies, plus all the cookies above and to the right of that cookie.
C. J. Budd and C. J. Sangwin show us how to create mazes, and explain why mazes and networks have much in common. In fact the study of mazes and labyrinths takes us into the dark territory of murder, suicide, adultery, passion, intrigue, religion and conquest...
There are many sorts of games played in a "bunco booth", where a trickster or sleight-of-hand expert tries to relieve you of your money by getting you to place bets - on which cup the ball is under, for instance, or where the queen of spades is. Lots of these games can be analysed using probability theory, and it soon becomes obvious that the games are tipped heavily in favour of the trickster!
The idea is this. To start with, you will choose an envelope at random, say by tossing a coin, and look at its contents, which is a cheque for some number - say n. (By randomising like this, you can be sure I haven't subconsciously induced you to prefer one envelope or the other.) You want to make sure that the bigger the number is, the more likely you are to keep it, in other words, the less likely you are to swap.