[C language] Hanoi Tower problem [recursion]

One 、 The problem background

Hanoi （Tower of Hanoi）, also called Hanoi Tower , It's one that comes from India Ancient legend Souptoys . brahma When he created the world, he made three diamond pillars , Stack on a column from bottom to top in order of size 64 A golden disk . Brahma commanded Brahmin Rearrange the disc on another column in order of size from below . And stipulate , You can't enlarge a disc on a small disc , Only one disc can be moved between the three pillars at a time .

Two 、 Thought analysis

3、 ... and 、 Code demonstration

Particular attention ： there ’A ‘B’'C ' It is different from the meaning of thinking analysis in the picture

// Hanoi 
#include <stdio.h>
void move(char pos1, char pos2)
{
    
	char pos3;
	pos3 = pos1;
	pos1 = pos2;
	pos2 = pos3;
}
void Hanio(int n, char pos1, char pos2, char pos3)
{
    
	if (n == 1)
		move(pos1, pos3);
	else
	{
    
		Hanio(n - 1, pos1, pos3, pos2);
		printf("%c->%c\n", pos1, pos3);
		move(pos1, pos3);
		Hanio(n - 1, pos2, pos1, pos3);
	}
}
int main()
{
    
	Hanio(3, 'A', 'B', 'C');
	return 0;
}