Opinion
Last month (August 2014), we presented three puzzles concerning the Path Game and the Match Game, each of which can be played on any finite graph.

### Author Archives

Opinion
Consider two simple games played by Alice and Bob on a checkerboard or, more generally, on a graph. The games look different, but, as we know, looks can be deceiving . . .
Opinion
Last month (May 2014) we posted three puzzles in which you were asked to sort several cards using three stacks on a table.
Opinion
Sorting is one of the most fundamental, and most studied, computational tasks. The problem is typically to put n items in order. The objective is to minimize time, space, number of comparisons, or number of rounds of comparisons.
Opinion
Last month (February 2014) we posted three games in which you were asked to pick a positive integer. The question in each was: What is the highest number you should think about picking? Here, we offer solutions to all three.
Opinion
Each of these puzzles involves a symmetric game. You will be asked about your best strategy, but what does "best strategy" mean?
Opinion
Last month (November 2013) we posted three tricky puzzles concerning coin flipping. Here, we offer solutions to all three. How did you do?
Opinion
Each of these puzzles involves coin flipping. Simple stuff, right? Not necessarily . . . though solutions will indeed be provided in next month's column.
Opinion
Last month (Aug. 2013) you needed to win several chess games in a row, alternately playing white and black, and had to decide with which color you should start.
Opinion
Each of these puzzles involves game-playing strategy. If you are sufficiently clever — and sufficiently unmotivated to work hard at being clever — you can solve them all without resorting to algebra.

### Shape the Future of Computing

ACM encourages its members to take a direct hand in shaping the future of the association. There are more ways than ever to get involved.

Get Involved