Sign In

Communications of the ACM

Last byte

Puzzled: Solutions and Sources


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
three cards

Credit: Merchant of Magic Ltd.

1. Three cards

Even though it would seem not too many things can be done with just three cards, there are actually 1.64 × 1018 memoryless algorithms to try, with most not working. You need brainpower. With some reasoning and experimentation, you may find that moving the cards mostly in one direction (such as to the right, including "around the corner" from the right stack to the left stack) helps avoid looping. Moreover, you generally want to expose more cards, except perhaps in some positions from which you might win. Of the several algorithms that do work, I like the following one, as suggested by my mathematics Ph.D. student Ewa Infeld, given by these four rules in priority order:

  1. Seeing 2,1,, place 1 on 2;
  2. Otherwise, seeing two cards, move one card right (around the corner if necessary) to the open place;
  3. Seeing just one card, move that card to the left; and
  4. Seeing three cards, move the middle-rank card to the right.

2. Any number of cards.

This same algorithm works for any number of cards, numbered 1 through n. It takes quadratic time in the worst or random case, or approximately a constant times n2 steps.

3. With just one card in the middle.

The following algorithm was submitted by Takashi Chiba in response to a puzzle column published in Japan, and communicated to me by Ko Sakai of the Graduate School of Pure and Applied Sciences, University of Tsukuba.

  1. Seeing just one card, move one card to the right;
  2. Seeing two cards:
      If the left stack is empty, move the center card to the right stack;
      If the center stack is empty, move the right card to the left stack; and
      If the right stack is empty, move the left card to the right stack.
  3. Seeing three cards, let the numbers on the cards be A, B, C from left to right:
      If C is the largest or smallest, move the smaller of A and B onto C; and
      If C is the middle, move the larger of A and B onto C.

This algorithm is cubic, requiring (2/3)n3 + (1/2)n2 (7/6)n steps if started with the cards stacked in reverse order on the left. Once started, it never has more than one card in the center. We thus see sorting can be done with only two LIFO stacks, a single register, and no memory. If you can beat that, please let me know...

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

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


Copyright held by Author/Owner(s).

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


Comments


Marc Auslander

I believe the following is quadratic and has not more than one card in the middle -

Call the stacks (and their top cards) A, B, and C

If B is empty:
if C is empty move A to B
elIf A is empty or A > C move C to A
else move C to B

If B is not empty:
If A is empty move B to A
If C is not empty and A > B > C move B to A
else move C to A

Intuitively, search left to right for an out of order card, then search right to left for a place to insert it.
Once all are sorted, the left to right search forces everything into the leftmost stack.


Displaying 1 comment

Sign In for Full Access
» Forgot Password? » Create an ACM Web Account
Article Contents:
  • Article
  • Author
  • Footnotes
  • ACM Resources