这个迭代的河内塔是如何运作的？ C

发布于 2024-09-02 02:04:52 字数 696 浏览 2 评论 0原文

可能的重复：
这是如何工作的？奇怪的河内塔解决方案

在浏览 Google 时，我发现了这个有趣的河内塔解决方案，它甚至不使用堆栈作为数据结构。

谁能简单地解释一下我，它实际上在做什么？

这个解决方案真的可以接受吗？

代码

#include <stdio.h>
#include <stdlib.h>

int main()
{
   int n, x;
   printf("How many disks?\n");
   scanf("%d", &n);
   printf("\n");
   for (x=1; x < (1 << n); x++)
      printf("move from tower %i to tower %i.\n",
         (x&x-1)%3, ((x|x-1)+1)%3);
return 0;
}

更新：硬编码的数字 3 在这里做什么？

原文

Possible Duplicate:
How does this work? Weird Towers of Hanoi Solution

While surfing Google, i found this interesting solution to Tower Of Hanoi which doesn't even use stack as data structure.

Can anybody explain me in brief, what is it actually doing?

Are this solution really acceptable?

Code

#include <stdio.h>
#include <stdlib.h>

int main()
{
   int n, x;
   printf("How many disks?\n");
   scanf("%d", &n);
   printf("\n");
   for (x=1; x < (1 << n); x++)
      printf("move from tower %i to tower %i.\n",
         (x&x-1)%3, ((x|x-1)+1)%3);
return 0;
}

Update: What is the hard-coded number 3 doing in here?

分享到QQ

分享到微博

如果你对这篇内容有疑问，欢迎到本站社区发帖提问参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。

发布评论

需要登录才能够评论，你可以免费注册一个本站的账号。

被你宠の有点坏 2024-09-09 02:04:52

在伪代码中可能更容易看出：

GET NUMBER OF DISKS AS n
WHILE x BETWEEN 1 INCLUSIVE AND 1 LEFT-SHIFTED BY n BITS
    SUBTRACT 1 FROM n, DIVIDE BY 3 AND TAKE THE REMAINDER AS A
    OR x WITH x-1, ADD 1 TO THAT, DIVIDE BY 3 AND TAKE THE REMAINDER AS B
    PRINT "MOVE FROM TOWER " A " TO TOWER " B
    ADD 1 TO x

1 左移 n 位基本上是 2 的 n 次方，在 4 个磁盘的情况下为 16。

如果您手动执行此序列，您应该会看到圆盘移动的进度。 http://library.ust.hk/images/highlights/Tower_of_Hanoi_4.gif

Might be easier to see in PSEUDOCODE:

GET NUMBER OF DISKS AS n
WHILE x BETWEEN 1 INCLUSIVE AND 1 LEFT-SHIFTED BY n BITS
    SUBTRACT 1 FROM n, DIVIDE BY 3 AND TAKE THE REMAINDER AS A
    OR x WITH x-1, ADD 1 TO THAT, DIVIDE BY 3 AND TAKE THE REMAINDER AS B
    PRINT "MOVE FROM TOWER " A " TO TOWER " B
    ADD 1 TO x

1 LEFT SHIFTED BY n BITS is basically 2 to the power of n, 16 in the case of 4 disks.

If you walk through this sequence manually, you should see the progression of movement of the disks. http://library.ust.hk/images/highlights/Tower_of_Hanoi_4.gif

回复收藏 0 原文