1. By A.F. Rockwell. White to mate in two moves. (Solutions are below.)
2. In 1866 Sam Loyd asked: Suppose you’re playing White against an opponent who’s required to mirror every move you make — if you play 1. Nf3 he must play 1. … Nf6, and so on. Can you design a game in which your eighth move forces your opponent to checkmate you with a nonmirror move?
3. An endgame study by J.A. Miles. “White to play and draw the game.”
A puzzle by Princeton mathematician John Horton Conway:
Last night I sat behind two wizards on a bus, and overheard the following:
A: I have a positive integral number of children, whose ages are positive integers, the sum of which is the number of this bus, while the product is my own age.
B: How interesting! Perhaps if you told me your age and the number of your children, I could work out their individual ages?
A: No.
B: Aha! AT LAST I know how old you are!
“This is an incredible puzzle,” writes MIT research affiliate Tanya Khovanova. “This is also an underappreciated puzzle. It is more interesting than it might seem. When someone announces the answer, it is not clear whether they have solved it completely.”
We can start by auditioning various bus numbers. For example, the number of the bus cannot have been 5, because in each possible case the wizard’s age and the number of his children would then uniquely determine their ages — if the wizard is 3 years old and has 3 children, then their ages must be 1, 1, and 3 and he cannot have said “No.” So the bus number cannot be 5.
As we work our way into higher bus numbers this uniqueness disappears, but it’s replaced by another problem — the second wizard must be able to deduce the first wizard’s age despite the ambiguity. For example, if the bus number is 21 and the first wizard tells us that he’s 96 years old and has three children, then it’s true that we can’t work out the children’s ages: They might be 1, 8, and 12 or 2, 3, and 16. But when the wizard informs us of this, we can’t declare triumphantly that at last we know how old he is, because we don’t — he might be 96, but he might also be 240, with children aged 4, 5, and 12 or 3, 8, and 10. So the dialogue above cannot have taken place.
But notice that if we increase the bus number by 1, to 22, then all the math above will still work if we give the wizard an extra 1-year-old child: He might now be 96 years old with four children ages 1, 1, 8, and 12 or 1, 2, 3, and 16; or he might be 240 with four children ages 1, 4, 5, and 12 or 1, 3, 8, and 10. The number of children increases by 1, the sum of their ages increases by 1, and the product remains the same. So if bus number b produces two possible ages for Wizard A, then so will bus number b + 1 — which means that we don’t have to check any bus numbers larger than 21.
This limits the problem to a manageable size, and it turns out that the bus number is 12 and Wizard A is 48 — that’s the only age for which the bus number and the number of children do not uniquely determine the children’s ages (they might be 2, 2, 2, and 6 or 1, 3, 4, and 4).
(Tanya Khovanova, “Conway’s Wizards,” The Mathematical Intelligencer, December 2013.)
Two similar puzzles: A Curious Conversation and A Curious Exchange.
I leave my front door, run on a level road for some distance, then run to the top of a hill and return home by the same route. I run 8 mph on level ground, 6 mph uphill, and 12 mph downhill. If my total trip took 2 hours, how far did I run?
A problem from the 2000 Moscow Mathematical Olympiad:
Some of the cards in a deck are face down and some are face up. From time to time Pete draws out a group of one or more contiguous cards in which the first and last are both face down. He turns over this group as a unit and returns it to the deck in the position from which he drew it. Prove that eventually all the cards in the deck will be face up, no matter how Pete proceeds.
In 1831 this riddle appeared in a British publication titled Drawing Room Scrap Sheet No. 17:
In the morn when I rise, / I open my eyes, / Tho’ I ne’er sleep a wink all night;
If I wake e’er so soon, / I still lie till noon, / And pay no regard to the light.
I have loss, I have gain, / I have pleasure, and pain; / And am punished with many a stripe;
To diminish my woe, / I burn friend and foe, / And my evenings I end with a pipe.
I travel abroad. / And ne’er miss my road, / Unless I am met by a stranger;
If you come in my way, / Which you very well may, / You will always be subject to danger.
I am chaste, I am young, / I am lusty, and strong, / And my habits oft change in a day;
To court I ne’er go, / Am no lady nor beau, / Yet as frail and fantastic as they.
I live a short time, / I die in my prime, / Lamented by all who possess me;
If I add any more, / To what’s said before / I’m afraid you will easily guess me.
It was headed “For Which a Solution Is Required,” perhaps meaning that the editor himself did not know the solution. I think he may have found the riddle in The Lady’s Magazine, which had published it anonymously in September 1780 without giving the answer. Unfortunately he seems to have been disappointed — the Drawing Room Scrap Sheet never printed a solution either.
A century and a half later, in 1981, Faith Eckler challenged the readers of Word Ways: The Journal of Recreational Linguistics to think of an answer, offering a year’s subscription to the journal as a reward. When no one had claimed the prize by February 2010, Ross Eckler renewed his wife’s challenge, noting that the National Puzzlers’ League had also failed to find a solution.
That’s understandable — it’s tricky. “The author of the riddle cleverly uses ambiguous phrases to mislead the solver,” Ross Eckler notes. “I still lie till noon (inert, or continue to?); evenings I end with a pipe (a tobacco holder, or a thin reedy sound?); to court I ne’er go (a royal venue, a legal venue, or courtship?).”
To date, so far as I know, the riddle remains unsolved. Answers proposed by Word Ways readers have included fame, gossip, chessmen, a hot air balloon, and the Star and Stripes, though none of these seems beyond question. I offer it here for what it’s worth.
UPDATE: A solution has been found! Apparently The Lady’s Diary published the solution in 1783, which Ronnie Kon intrepidly ran to earth in the University of Illinois Rare Book and Manuscript Library. He published it in Word Ways in November 2012 (PDF). I’ll omit the solution here in case you’d still like to guess; be warned that it’s not particularly compelling. (Thanks, Ronnie.)
Starting in Delaware, you must tour the 48 contiguous United States, visiting each state exactly once.
Where will you finish?
A puzzle from Oswald Jacoby’s Mathematics for Pleasure (1962):
The MacDonalds are planning a long car journey of 27,000 miles. If they use tires that last 12,000 miles each, how many tires will they need, and how can they make the best use of them?
A quickie submitted by John Astolfi to MIT Technology Review’s Puzzle Corner, July/August 2013:
Consider the expansion of π (3.14159 …) in base 2. Does it contain more 0s than 1s, more 1s than 0s, or an equal number of both? Or is it impossible to tell?
.jpg){kind=link}