Computing Applications Last byte

Puzzled: Wins in a Row

  1. Article
  2. Author
  3. Footnotes
chess pieces

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. Here is the premise: You have applied to join a chess club and been told that to qualify you must play three games against Ioana (the last new member), winning two games in a row. "Who gets the white pieces?" you ask and are told you and Ioana alternate and you get to decide whether to start with white or with black.

  1. Knowing that the probability of beating Ioana is better with the white pieces (first-move advantage), should you choose white or black for the first game?
  2. Suppose now that prior to the match, you discover Ioana is a former City Champion of Bucharest. Complaining, you persuade the club to give you the following concession: You must still beat Ioana two games in a row, but now you get to play her as many as 17 times, alternating sides as before. Should you choose white or black for the first game?
  3. You managed to win two games in a row from Ioana and are now a member of the club. However, to become an officer of the club, you must beat Ioana 10 times in a row, with 49 games to do it. Yipes! This may be more than you can handle, but to maximize your chances, should you start with white or with black?

Back to Top

Back to Top

Join the Discussion (0)

Become a Member or Sign In to Post a Comment

The Latest from CACM

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

Communications of the ACM (CACM) is now a fully Open Access publication.

By opening CACM to the world, we hope to increase engagement among the broader computer science community and encourage non-members to discover the rich resources ACM has to offer.

Learn More