当前位置:网站首页>Recursive implementation of the Tower of Hanoi problem
Recursive implementation of the Tower of Hanoi problem
2022-07-31 04:01:00 【GD_small_bit】
I brought the Tower of Hanoi todayC语言实现代码.
汉诺塔(Tower of Hanoi),又称河内塔,是一个源于印度古老传说的益智玩具.大梵天创造世界的时候做了三根金刚石柱子,在一根柱子上从下往上按照大小顺序摞着64片黄金圆盘.大梵天命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上.并且规定,在小圆盘上不能放大圆盘,在三根柱子之间一次只能移动一个圆盘.
There are three pillars as follows:
游戏规则如下:在a柱上会有n个盘子,And the big plate is below,The small plate is on top,每次只能移动一个盘子,Press the plate from largest to smallestcThe pillars are arranged upwards.
Suppose there is only one plate,Then we take the plate directly fromacolumn moved toc柱,即a->c.
假设aThere are two plates on the column,Then we should move the plate to the smaller oneb柱,Then move the larger platec盘,再将bThe plate on the column is moved toc柱,即 a->b , a->c , b->c This also completes the mission of the game.
假设a柱上有三个盘子,Then we should remove the smallest plate froma柱移到c柱,Then remove the smaller plate froma柱移到b柱,Then remove the smallest plate fromc柱移到b柱,再将最大的盘子从a柱移到c柱,再将bThe column with the smallest column moves toa柱,再将bMove the column to the smaller platec柱,最后把aMove the column plate toc柱.即 a->c , a->b , c->b , a->c , b->a , b->c , a->c .
下面是代码实现.
#include<stdio.h>
void move (char pos1,char pos2)
{
printf(" %c->%c ",pos1,pos2);
}
void Hanoi (int n ,char pos1,char pos2,char pos3)
{
if(n==1)
{
move(pos1,pos3);
}
else
{
Hanoi(n-1,pos1,pos3,pos2);
move(pos1,pos3);
Hanoi(n-1,pos2,pos1,pos3);
}
}
int main ()
{
Hanoi(1,'a','b','c');
printf("\n");
Hanoi(2,'a','b','c');
printf("\n");
Hanoi(3,'a','b','c');
printf("\n");
}
运行结果如下:
如果觉得写的可以,关注点一点,下期更精彩.
边栏推荐
- C# 实现PLC的定时器
- volatile内存语义以及实现 -volatile写和读对普通变量的影响
- [AUTOSAR-RTE]-5-Explicit (explicit) and Implicit (implicit) Sender-Receiver communication
- 慧通编程第4关 - 魔法学院第6课
- Thinking about data governance after Didi fines
- 问题1:给你1-10的列表,实现列表输出,单数在左边,双数在右边。
- qlib架构
- SQL Interview Questions (Key Points)
- (四)递归、可变参数、访问修饰符、理解 main 方法、代码块
- 安全20220709
猜你喜欢
No qualifying bean of type question
(5) final, abstract class, interface, inner class
type_traits元编程库学习
[C language] Preprocessing operation
识Flutter 基本组件之showTimePicker 方法
已解决:不小心卸载pip后(手动安装pip的两种方式)
[Dynamic programming] Maximum sum of consecutive subarrays
[Swift]自定义点击APP图标弹出的快捷方式
浅识Flutter 基本组件之CheckBox组件
[Paper reading] Mastering the game of Go with deep neural networks and tree search
随机推荐
Safety 20220715
浅识Flutter 基本组件之showDatePicker方法
Detailed explanation of TCP (2)
pom文件成橘红色未加载的解决方案
errno错误码及含义(中文)
ClickHouse:设置远程连接
ClickHouse: Setting up remote connections
Web container and IIS --- Middleware penetration method 1
安全20220722
[C language] General method for finding the sum of the greatest common factor and the least common multiple of two integers m and n, the classical solution
PMP WeChat group daily exercises
Pytest e-commerce project combat (on)
addressable in Golang
LocalDate addition and subtraction operations and comparison size
els block to the right
$parent/$children 与 ref
Thinking about data governance after Didi fines
Ambiguous method call.both
[C language] Preprocessing operation
端口排查步骤-7680端口分析-Dosvc服务