/*
二色汉诺塔 
*/

#include <stdio.h>

void hanoi(int disks, char sources, char temp, char target)
{
    if(disks == 1)
    {
        printf("move disk from %c to %c \n", sources, target);
        printf("move disk from %c to %c \n", sources, target);
    }
    else
    {
        hanoi(disks - 1, sources, target, temp);
        hanoi(1, sources, temp, target);
        hanoi(disks - 1, temp, sources, target);
    }
}

void hanoi2colors(int disks)
{
    char source = 'A';
    char temp = 'B';
    char target = 'C';
    int i;
    for(i = disks / 2; i > 1; i--)
    {
        hanoi(i - 1, source, temp, target);
        printf("move disk from %c to %c \n", source, temp);
        printf("move disk from %c to %c \n", source, temp);
        hanoi(i - 1, target, temp, source);
        printf("move disk from %c to %c \n", temp, target); 
    }
    printf("move disk from %c to %c \n", source, temp);
    printf("move disk from %c to %c \n", source, target);
}

int main()
{
    int n;
    printf("请输入盘数:");
    scanf("%d", &n);
    hanoi2colors(n);
    
    return 0; 
}

 

运行结果:

【二色汉诺塔 】

 

相关文章:

  • 2021-12-18
  • 2021-12-23
  • 2021-06-04
  • 2021-11-28
  • 2021-12-25
  • 2022-01-14
  • 2021-08-17
  • 2021-12-28
猜你喜欢
  • 2021-12-25
  • 2021-04-26
  • 2022-01-11
  • 2021-09-19
  • 2021-12-22
  • 2021-09-20
  • 2021-07-22
  • 2021-07-08
相关资源
相似解决方案