评论
打印
Your friend's birthday is tomorrow, and he's turning... well... the issue is that you've forgotten.
你朋友的生日是在明天，他的岁数将是...额...问题是你已经忘记了。
He's older than 1, but beyond that, he looks timeless. You'd believe it if he was 2 or 200.
他超过1岁了，但是除此之外，他好像万寿无疆。你完全相信他2岁或者200岁了。
The birthday boy is a giant, and you're afraid that if your forgetfulness becomes known, you'll become part of the feast.
寿星是个巨人，你害怕一旦他知道了你的健忘，你就会变成他盛餐的一部分。
The baker has meticulously prepared a small mountain range of a cake, and your job is to sculpt the giant's age as the chocolate centerpiece.
面包师精心准备了一个像小山一样的的蛋糕，而你的工作就是把巨人的年龄雕刻成巧克力的中心装饰。
You would love to just count the candles on the cake, but you're much too small to see the top of it.
你很想数一数蛋糕上的蜡烛，但是你太小了，根本看不到顶上的蜡烛。
Then you remember: the baker made an interior tunnel to activate the candles from below.
然后你想起来了：为了从下面点亮蜡烛，面包师制作了一条内部隧道。
While the giant is asleep, you can sneak in, count the candles and escape undetected.
趁巨人睡着的时候，你可以溜进去，数一数蜡烛，然后悄悄逃走。
As night sets, you pull on a full bodysuit and brace yourself for vanilla cream.
夜幕降临时，你穿上一套紧身衣，钻进香草奶油里。
Anywhere in the tunnel, you can see whether the candle above you is lit, and can switch it on or off.
在隧道的任何地方，你都可以看到你上方的蜡烛是否被点亮，还可以点亮或者熄灭它。
Some are currently on, and others off, in no discernible pattern.
现在有些蜡烛是点亮的，有些是熄灭的，没有明显的规律。
The tunnel is a single loop, and in the dark you can't tell its shape or size.
隧道是一个单环，在黑暗中无法分辨它的形状和大小。
You aren't carrying anything with you, and any marks you make will disappear. You need a strategy. How can you count the candles?
你什么都没带，而且任何你做的标记都会消失。你需要想出一种策略。你要怎么数蜡烛呢？
There are a few ways to solve this problem. Let's start with the most straightforward.
有几种方法能解决这个问题。让我们从最直接的开始。
There's exactly one way to mark a location in the tunnel: the state of the candle.
恰有一种方法可以标记隧道中的位置：依靠蜡烛的状态。
You can mark the first candle you reach by lighting it or keeping it on.
你可以标记遇到的第一支蜡烛，点亮它或让它一直亮着。
If you walk forward, you'll eventually find another lit candle -- either a new one or you're starting one.
如果你向前走，你最终会找到另一支点亮的蜡烛--要么是新的，要么是一开始那根。
The question is: how could you know which?
问题是：你怎么能知道它是哪支？
Here's one approach: turn it off and backtrack to the start by passing the same number of candles you passed on the way there.
有一个方法：熄灭它，走过和来的时候相同数量的蜡烛时，再由原路返回。
If the starting candle is now off, you've completed the loop and know the giant's age!
如果起始蜡烛现在熄灭了，那你就已经走完了环路，并且知道了巨人的年龄！
Otherwise, depart again, continuing until the next lit candle, testing if it's your starting one and so on. This will work... eventually.
否则就再出发，直到下一支点亮的蜡烛，验证它是不是起始蜡烛，如此循环往复。这个方法到最后一定能成功。
But if the giant isn't young, and many candles are on, you might have a marathon to run between now and sunrise.
但是如果巨人不年轻，而且很多蜡烛都亮着，从现在到日出，你可能要跑一场马拉松了。
And you definitely don't want to be in the cake when he starts digging in. So let's look for a more efficient solution.
当他开始大吃特吃的时候，你肯定不想在蛋糕里。所以让我们来找一个更有效的解决方法。
How about testing a series of hypotheses about the giant's age? Suppose you guess he's turning 10.
我们来猜这个巨人的年龄如何？假设你猜他10岁了。
You could light the starting candle, walk forward 10, switch or leave the destination candle off, and return.
你可以点亮起始蜡烛，向前走10支，让到达的那支蜡烛熄灭着，然后返回。
If the starting candle's still on, 10 isn't the answer.
如果开始的蜡烛还亮着，那么10就不是答案。
If it's off, 10 could be right, but you may have made multiple loops -- so 10's factors 5 and 2 are also possibilities.
如果它是熄灭的，那10可能是对的，但是你可能循环不止一次，所以10的因子5和2也是可能的。
Then you would have passed a repeating pattern -- but that could have just been the starting arrangement.
接着你就会通过一个重复模式--但这可能只是开始的排列。
So what if you changed the candles on the way?
如果你在路上换了蜡烛呢？
If you turned them all on while walking from candle 1 to 11, switch that off, then turn back, the first unlit candle you find would tell you the exact candle count.
如果你从1号蜡烛走到11号蜡烛时，把它们都点亮，熄灭它，然后走回去，你找到的第一支熄灭的蜡烛会告诉你确切的蜡烛数量。
And if you don't hit any extinguished candles, you'll know that the total must be higher than 10.
如果你没有遇到任何熄灭的蜡烛，那你该知道总数一定大于10。
You could then pick a larger guess and try again. To be systematic, you could increase your guess by the same number each time, say 4.
然后你可以猜一个更大的数字，再次尝试。更有系统一点，你的每一个假设，可以增加相同的数字，比如4。
If there were 99 candles, this method would take 24 roundtrips and involve visiting nearly 2,700 candles.
如果一共有99支蜡烛，这种方法需要往返24次，需要经过近2700支蜡烛。
But you don't have to increase your guess linearly.
但你不需要线性地增加你的猜测。
For instance, you could double it, from 10 to 20 to 40, and discover the true number on your 5th trip after around 560 candles.
例如，你可以把它翻倍，从10到20到40，在你的第五次往返中，大约560根蜡烛后，发现真正的数字。
Doubling allows you to reach high numbers quickly, while starting with small intervals in case there are only a few candles.
翻倍可以让你快速达到较高的数值，开始的时候间隔要小，以防只有几根蜡烛。
After expecting a lengthy trek, you're pleased to discover the giant is only turning 12.
在预计可能要经历一次长途跋涉后，你很高兴发现这个巨人才12岁。
You hurry to change into slightly more inconspicuous clothing; chisel up some enormous chocolate numbers;
你赶紧换上稍微不显眼的衣服，凿好巧克力数字，
and at the party, make your own wish: that you're not downwind when your friend blows out his candles.
然后在派对上许下你自己的愿望：当你朋友吹蜡烛的时候，你不在下风处。
