acm-header
Sign In

Communications of the ACM

Last byte

Puzzled: Designs on Square Grids


View as: Print Mobile App ACM Digital Library Full Text (PDF) In the Digital Edition Share: Send by email Share on reddit Share on StumbleUpon Share on Hacker News Share on Tweeter Share on Facebook
puzzle

Credit: Barry Cipra

  1. In composing this puzzle, writer/mathematician Barry Cipra was inspired by a work called "Straight Lines in Four Directions and All Their Possible Combinations" by the great American artist Sol Lewitt. You are given 16 unit squares, each containing a different combination of vertical crossing line, horizontal crossing line, SW-NE diagonal, and SE-NW diagonal. The object is to tile a 4×4 grid with these squares (without rotating them) in such a way that no line ends before it hits the edge of the grid or, alternatively, prove it cannot be done. Figure 1 shows a failed attempt, with dangling ends circled.
  2. Cipra also composed an entertaining curved version. In it, each unit square contains one of the 16 possible combinations of four quarter circles, each of radius 1/2 and centered at a corner. Can you tile a 4×4 grid with these squares so no path ends before it hits the edge of the grid? Or, better still, can you arrange the tiles so an even number of quarter circles meet at each edge shared by two squares? Figure 2 shows a failed attempt, again with dangling ends circled.
  3. We now upgrade to a 5×5 grid in a puzzle passed to me by my Dartmouth colleague Vladimir Chernov. In it, each unit square is blank or has one diagonal drawn in. How many non-blanks can you pack in without any two diagonals meeting at a corner? Figure 3 shows a legal configuration with 15 diagonals. Can you beat it with 16 diagonals? Or prove 15 is the maximum possible?

Back to Top

Author

Peter Winkler (puzzled@cacm.acm.org) is William Morrill Professor of Mathematics and Computer Science at Dartmouth College, Hanover, NH.

Back to Top

Footnotes

Readers are encouraged to submit prospective puzzles for future columns to puzzled@cacm.acm.org.

Back to Top

Figures

F1Figure 1.

F2Figure 2.

F3Figure 3.

Back to top


©2012 ACM  0001-0782/12/0500  $10.00

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 permissions@acm.org or fax (212) 869-0481.

The Digital Library is published by the Association for Computing Machinery. Copyright © 2012 ACM, Inc.


 

No entries found