(۲۸-فروردین-۱۳۸۹, ۱۴:۳۳:۳۸)mhzza نوشته است: [ -> ]در مورد برجهاي هانوي و برنامه برجهاي هانوي كسي ميتونه كمكم كنه ( الگوريتم برجهاي هانوي )
ممنون ميشم
program hanoy;
var
n:integer;
procedure tower(fromp,top,help:char;n:integer) ;
begin
if n=1 then
writeln('move disk 1 form ',fromp,' to ',top)
else
begin
tower(fromp,help,top,n-1);
writeln('move disk ',n,' from ',fromp,' to ',top);
tower(help,top,fromp,n-1);
end
end;
Begin
write('Enter number of disks : ');
readln(n);
tower('A','B','C',n);
readln;
End.* hanoi.cpp solves the Towers of Hanoi puzzle recursively.
*
* Input: numDisks, the number of disks to be moved
* Output: a sequence of moves that solve the puzzle */
#include <iostream.h>
#include <conio.h>
void Move(int n, char source, char destination, char spare);
int count = 0;
int main()
{
const char PEG1 = 'A', // the three pegs
PEG2 = 'B',
PEG3 = 'C';
cout << "This program solves the Hanoi Towers puzzle.\n\n";
cout << "Enter the number of disks: ";
int numDisks; // the number of disks to be moved
cin >> numDisks;
cout << endl;
Move(numDisks, PEG1, PEG2, PEG3); // the solution
// getch();
return 0;
}
/* Move is a recursive function to solve the
* Towers of Hanoi puzzle.
*
* Receive: n, the number of disks to be moved;
* source, peg containing disk to move
* destination, peg where to move disk
* spare, peg to store disks temporarily,
* Output: A message describing the move
**************************************************/
void Move(int n,
char source, char destination, char spare)
{
if (n <= 1) // anchor
cout << "Move the top disk from " << source
<< " to " << destination << endl;
else
{ // inductive case
Move(n-1, source, spare, destination);
Move(1, source, destination, spare);
Move(n-1, spare, destination, source);
}A to B
A to C
C to B
A to C
B to A
B to C
A to C
void Hanoi(n,A,B,C)
{
if(n==1)
mov disk #n from A to C
else
{
Hanoi(n-1,A,C,B)
mov disk #n from A to C
Hanoi(n-1,B,A,C)
}
}