main.c

/*
 * File: main.c
 * Authors: Gabriel Graells, Arnau Blanco, Asfandyar Abbasi.
 * 
 * 
 * 
 * This file contains the "main" function which calls all other major functions, the "hanoiprint" which 
 * prints the node thats is being passed and also clear memory function which frees the memory at the
 * end of the program.
 
 */
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "main.h"
#include "menu.h"
#include "database.h"
#include "playgame.h"

void hanoi(int nd, int torg, int tdest, int taux, stack *list){
    if (nd == 1){
        movedisk(torg, tdest, list, list->disk-nd);
        }
    else{
        hanoi(nd - 1, torg, taux, tdest, list);
        movedisk(torg, tdest, list, list->disk-nd);
        hanoi(nd - 1, taux, tdest, torg, list);
    }                                                     
}

int main(int argc, char **argv){
    /*DESIGN GAME PRITING*/
    printf("HANOI GAME\n===========\n\n");
    /*STACK INITIALISATION*/
    stack list; //stack declaration
    gstruct g; //struct top play game
     g.disk=NDISKS;
    init_matrix(&g); //initializing the pplay game matrix.
    list.num = 0; //number of moves at the star will be zero.
    list.disk=NDISKS;
    strcpy(list.operation,"ap");
    int printfile = command(argv,argc,&list); 

    /*REQUEST FOR THE NUMBER OF DISKS*/
    node_t* newnode=encapsulateinfo(list.disk); //Initialise the matrix according to the number of disks
    createFirstNode(newnode,&list); //create new node function
    hanoi(list.disk,0,1,2,&list);
    //checks if it has to create a file or just print the matrice on the screen.
    if(printfile==1){
        create_file(&list, argv, argc);
    }
    else{
        for(int c=0; c<=list.num; c++){
        int m;
        node_t *cnode;
        cnode= list.top;
        for(m=list.num; m>c; m--){
            cnode = cnode->prev;
        }
        hanoiprint(cnode, list.disk);
    }
    }
    
    menu_directory(&list, &g);
    clearmemory(&list);
    
    //free(&list);
    return(0);
}

void hanoiprint(node_t *newnode,int numdisks){
    printf(LOGDISKS,newnode->move_num,newnode->depth,newnode->disk_moved,newnode->torg,newnode->tdest);
    printf("%s",NEWLINE);
    /*LOOP TO PRINT EACH LINE OF THE DRAWING OF THE GAME*/
    for(int i=0; i<numdisks; i++){
        for(int k=0; k<NTOWERS; k++){
           int dashes = newnode->matrix[i][k]; //Declaration of the value in position k i in the matrix
           int dots=numdisks-dashes;
           /*PRINT DOT D-max TIMES*/ 
           for(int j=0; j<dots; j++)
                printf(".");
           
           /*PRINT UNDERSCORE max TIMES*/
           for(int j=0; j<dashes; j++)
                printf("-");
           
           /*PRINT VERTICAL BAR*/
           printf("|");
           
           /*PRINT UNDERSCORE max TIMES*/
            for(int j=0; j<dashes; j++)
                printf("-");
           
           /*PRINT DOT D-max TIMES*/
            for(int j=0; j<dots; j++)
                printf(".");
           
           
           
           //If it's not printing the last tower, then print a tabspace
           if(k<NTOWERS-1){
               printf("%s",TABSPACE);
           }
           else{
               printf("\n");
           }
        }
    }
    printf("\n");
}
//frees the memory from each node and matrix.
void clearmemory (stack *list){
    for(int c=0; c<=list->num; c++){
        int m;
        node_t *cnode;
        cnode= list->top;
        for(m=list->num; m>c; m--){
            cnode = cnode->prev;
        }
        for(int c=0;c<list->disk;c++){
            for (int k= 0; k<NTOWERS; k++){    
                free(*cnode->matrix[c][k]);    
            }
        }

        free(cnode);
    }
}