Question

求英语大神.求专业翻译几段英语

So the real problem is that problem solving does not belong to the things Charlie is good at. Actually, the only thing Charlie is really good at is "sitting next to someone who can do the job". And now guess what — exactly! It is you who is sitting next to Charlie, and he is already glaring at you.
Luckily, you know that the following algorithm works for n <= 12: At first k >= 1 disks on tower A are fixed and the remaining n-k disks are moved from tower A to tower B using the algorithm for four towers.Then the remaining k disks from tower A are moved to tower D using the algorithm for three towers. At last the n - k disks from tower B are moved to tower D again using the algorithm for four towers (and thereby not moving any of the k disks already on tower D). Do this for all k 2 ∈{1, .... , n} and find the k with the minimal number of moves.
So for n = 3 and k = 2 you would first move 1 (3-2) disk from tower A to tower B using the algorithm for four towers (one move). Then you would move the remaining two disks from tower A to tower D using the algorithm for three towers (three moves). And the last step would be to move the disk from tower B to tower D using again the algorithm for four towers (another move). Thus the solution for n = 3 and k = 2 is 5 moves. To be sure that this really is the best solution for n = 3 you need to check the other possible values 1 and 3 for k. (But, by the way, 5 is optimal. . . )

Answer 1

So the real problem is that problem solving does not belong to the things Charlie is good at. Actually, the only thing Charlie is really good at is "sitting next to someone who can do the job". And now guess what — exactly! It is you who is sitting next to Charlie, and he is already glaring at you.
真正的问题在于解决问题并不属于查理的强项。事实上，查理唯一最会干的事就是“紧挨着坐在一个能干活儿的人的身边”。你猜怎么着？ 对啦！您正是坐在查理身旁的那位，他现在正不怀好意地盯着你瞧呢。

Luckily, you know that the following algorithm works for n <= 12: At first k >= 1 disks on tower A are fixed and the remaining n-k disks are moved from tower A to tower B using the algorithm for four towers.Then the remaining k disks from tower A are moved to tower D using the algorithm for three towers. At last the n - k disks from tower B are moved to tower D again using the algorithm for four towers (and thereby not moving any of the k disks already on tower D). Do this for all k 2 ∈{1, .... , n} and find the k with the minimal number of moves.
所幸的是，你知道下面这种算法对 n<=12 时是管用的：首先，k >= 1 个在A那一摞的圆盘数量是固定的，采用四摞的步骤把剩下的 n-k 个圆盘从A摞移到B摞。接着用三摞的步骤把剩下的 k 个圆盘从A摞移到D摞。最后，再一次用四摞的步骤把剩下的 n-k 个圆盘从B摞移到D摞（这样就不会去动到任何已经在D摞的 k 个圆盘啦。 在所有k 2 ∈{1, .... , n} 时重复这个程序，这样就能找出移动次数最少的 k 值了。

So for n = 3 and k = 2 you would first move 1 (3-2) disk from tower A to tower B using the algorithm for four towers (one move). Then you would move the remaining two disks from tower A to tower D using the algorithm for three towers (three moves). And the last step would be to move the disk from tower B to tower D using again the algorithm for four towers (another move). Thus the solution for n = 3 and k = 2 is 5 moves. To be sure that this really is the best solution for n = 3 you need to check the other possible values 1 and 3 for k. (But, by the way, 5 is optimal. . . )
因此当 n = 3 而 k = 2 时你首先将采用四摞的步骤把1个(3-2) 圆盘从A摞移到B摞(移动一次“走一步”）。接着用三摞的步骤把剩下的2个圆盘从A摞移到D摞（走三步）。而最后一步将是再一次用四摞的步骤把剩下的最后1个圆盘从B摞移到D摞（又算一步）。如此当 n = 3 而 k = 2 时的答案就是移动五次（走五步）。要想确定这是 n=3 时的最佳方案，你必须查一下其他当K 在1和3时的结果。（但，顺便一提的，5会是最理想的...)

注：听来是挺有趣的某种数学理论实验...

Answer 2

所以真正的问题是，解决问题欺诈不属于东西查理擅长。其实，唯一的查理真擅长"坐几乎某人谁能起作用"。现在猜什么—究竟!它是你在坐谁几乎查理，他已怒视你。

Answer 3

所以真正的问题是解决问题的东西不属于查理很擅长。事实上,唯一查理很擅长是“坐在他旁边的人能做这项工作”。现在你猜怎么着-完全正确!是你自己坐在旁边,查理,他已经怒视着你。
幸运的是,你知道以下算法为氮< = 12:首先钾> = 1盘塔一个固定的,剩下的n-k塔移到磁盘B座,四towers.T,应用该算法

Answer 4

所以真正的问题是解决问题的东西不属于查理很擅长。事实上,唯一查理很擅长是“坐在他旁边的人能做这项工作”。现在你猜怎么着-完全正确!是你自己坐在旁边,查理,他已经怒视着你。

幸运的是,你知道以下算法为氮< = 12:首先钾> = 1盘塔一个固定的,剩下的n-k塔移到磁盘B座,应用该算法四的城楼。然后其余凯西磁盘塔移到是使用算法塔D三塔。最后,n - k磁盘B座的感动到塔D再次使用的算法进行了4座塔(从而不会移动的任何凯西磁盘已塔D)。做这为全部钾肥∈{ 1、2 ....、氮}并找到凯西,以最少的数目的著手。

对于n = 3和k = 2你首先移动1(2 - 3)盘在塔A到B座,应用该算法为4座塔(走)。然后你就会剩下的两个圆盘,塔塔D试用上述方法三塔(三移动)。最后的步骤可以让移动磁盘B塔塔的算法进行了再使用D 4座塔(另一个移动)。因此,解决方案3例k = 2 5动作。可以肯定的是,这真的,最好的办法是给n = 3你需要检查其他可能的值为1号和3号k。(但是,顺便说一句,5是最优的。。)