Thumbnail
Access Restriction
Subscribed

Author Winkler, Peter
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract Last month (May 2014) we posted three puzzles in which you were asked to sort several cards using three stacks on a table; you were allowed to move the top card of one stack to the top of another (possibly empty) stack, with the object being to get all the cards in their natural order stacked in the leftmost place. The catch was you could see only the top cards of the stacks and had no memory. Not included were proofs that the algorithms described in the following solutions actually work; indeed, the best way to see how they work is to take three cards (or a whole suit) from a deck of playing cards and try.
Description Affiliation: Dartmouth College, Hanover, NH (Winkler, Peter)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 57
Issue Number 6
Page Count 1
Starting Page 110
Ending Page 110


Open content in new tab

   Open content in new tab
Source: ACM Digital Library