Question

Tower of Hanoi problem

please use this code

#pragma once

#include

#include

#include

#include

using namespace std;

class TowersOfHanoi

{

friend ostream& operator<<(ostream& sink, const TowersOfHanoi& towers);

public:

//constructor

TowersOfHanoi();

//custom methods

unsigned move(unsigned new_n_disks = 6, ostream& new_sink = cout);

private:

//custom methods

void move_aux(ostream& sink, unsigned n_disks, unsigned srce, unsigned dest, unsigned aux);

//temporary variable

unsigned _n_moves;

//data

const unsigned _n_towers;

stack* _tower;

};

#include "TowersOfHanoi.h"

//

ostream& operator<<(ostream& sink, const TowersOfHanoi& hanoi)

{

for (unsigned index = 0; index < hanoi._n_towers; index++)

{

sink << index + 1 << ": ";

stack temp;

while (!hanoi._tower[index].empty())

{

unsigned top = hanoi._tower[index].top();

hanoi._tower[index].pop();

temp.push(top);

}

while (!temp.empty())

{

unsigned top = temp.top();

temp.pop();

hanoi._tower[index].push(top);

sink << top << ' ';

}

sink << endl;

}

sink << "---" << endl;

return sink;

}

TowersOfHanoi::TowersOfHanoi(void)

:_n_towers(3)

{

_tower = NULL;

_n_moves = 0;

}

unsigned TowersOfHanoi::move(unsigned n_disks, ostream& sink)

{

if(n_disks < 1)

throw string("TowersOfHanoi:move - new-n-disks is 0 or negative");

_tower = new stack[_n_towers];

for(unsigned disk = n_disks; disk > 0; disk--)

_tower[0].push(disk);

  

_n_moves = 0;

sink << *this << endl;

move_aux(sink, n_disks, 0, 2, 1);

delete [] _tower;

return _n_moves;

}

void TowersOfHanoi::move_aux(ostream& sink, unsigned n_disks, unsigned srce, unsigned dest, unsigned aux)

{

if(n_disks > 1)

{

//move n -1 disks from source to auxilliary

//move_ 1 disk from source to destination

//mov n -1 disks from axuilliary to destination

}

else

{

unsigned top = _tower[srce].top();

_tower[srce].pop();

_tower[dest].push(top);

_n_moves++;

sink << *this << endl;

}

}

// testTowersOfHanoi.cpp : Defines the entry point for the console application.

//

#include

#include

#include "towersofhanoi.h"

using namespace std;

int main()

{

try

{

TowersOfHanoi towers;

for (unsigned n_disks = 1; n_disks <= 10; n_disks++)

{

cout << towers.move(n_disks) << " moves " << endl;

system("pause");

cout << endl << endl;

}

}

catch(string message)

{

cout << message << endl;

}

catch(...)

{

cout << "something is dreadfully wrong" << endl;

}

system("pause");

return 0;

}

that's all

Answer 1

// this is a C Program #include <stdio.h> #include <math.h> #include <stdlib.h> #include <limits.h> struct Stack { unsigned capacity; int top; int *array; }; // function to create a stack of given capacity. struct Stack* createStack(unsigned capacity) {     struct Stack* stack =         (struct Stack*) malloc(sizeof(struct Stack));     stack -> capacity = capacity;     stack -> top = -1;     stack -> array =         (int*) malloc(stack -> capacity * sizeof(int));     return stack; } // Stack is full when top is equal to the last index int isFull(struct Stack* stack) { return (stack->top == stack->capacity - 1); } // Stack is empty when top is equal to -1 int isEmpty(struct Stack* stack) { return (stack->top == -1); } // Function to add an item to stack. It increases // top by 1 void push(struct Stack *stack, int item) {     if (isFull(stack))         return;     stack -> array[++stack -> top] = item; } // Function to remove an item from stack. It // decreases top by 1 int pop(struct Stack* stack) {     if (isEmpty(stack))         return INT_MIN;     return stack -> array[stack -> top--]; } //Function to show the movement of disks void moveDisk(char fromPeg, char toPeg, int disk) {     printf("Move the disk %d from \'%c\' to \'%c\'\n",         disk, fromPeg, toPeg); } // Function to implement legal movement between // two poles void moveDisksBetweenTwoPoles(struct Stack *src,             struct Stack *dest, char s, char d) {     int pole1TopDisk = pop(src);     int pole2TopDisk = pop(dest);     // When pole 1 is empty     if (pole1TopDisk == INT_MIN)     {         push(src, pole2TopDisk);         moveDisk(d, s, pole2TopDisk);     }     // When pole2 pole is empty     else if (pole2TopDisk == INT_MIN)     {         push(dest, pole1TopDisk);         moveDisk(s, d, pole1TopDisk);     }     // When top disk of pole1 > top disk of pole2     else if (pole1TopDisk > pole2TopDisk)     {         push(src, pole1TopDisk);         push(src, pole2TopDisk);         moveDisk(d, s, pole2TopDisk);     }     // When top disk of pole1 < top disk of pole2     else     {         push(dest, pole2TopDisk);         push(dest, pole1TopDisk);         moveDisk(s, d, pole1TopDisk);     } } //Function to implement TOH puzzle void tohIterative(int num_of_disks, struct Stack             *src, struct Stack *aux,             struct Stack *dest) {     int i, total_num_of_moves;     char s = 'S', d = 'D', a = 'A';     //If number of disks is even, then interchange     //destination pole and auxiliary pole     if (num_of_disks % 2 == 0)     {         char temp = d;         d = a;         a = temp;     }     total_num_of_moves = pow(2, num_of_disks) - 1;     //Larger disks will be pushed first     for (i = num_of_disks; i >= 1; i--)         push(src, i);     for (i = 1; i <= total_num_of_moves; i++)     {         if (i % 3 == 1)         moveDisksBetweenTwoPoles(src, dest, s, d);         else if (i % 3 == 2)         moveDisksBetweenTwoPoles(src, aux, s, a);         else if (i % 3 == 0)         moveDisksBetweenTwoPoles(aux, dest, a, d);     } } // Driver Program int main() {     // Input: number of disks     unsigned num_of_disks = 3;     struct Stack *src, *dest, *aux;     // Create three stacks of size 'num_of_disks'     // to hold the disks     src = createStack(num_of_disks);     aux = createStack(num_of_disks);     dest = createStack(num_of_disks);     tohIterative(num_of_disks, src, aux, dest);     return 0; }