Each of these puzzles involves game-playing strategy. If you are sufficiently cleverand sufficiently unmotivated to work hard at being cleveryou 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.
Readers are encouraged to submit prospective puzzles for future columns to email@example.com.
©2013 ACM 0001-0782/13/08
Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and full citation on the first page. Copyright for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or fee. Request permission to publish from firstname.lastname@example.org or fax (212) 869-0481.
The Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
No entries found