cleverMd.h

#ifndef CLEVERMD_H
#define CLEVERMD_H
#include "struct.h"
//#include "labyrinthAPI.h"

/*! \file astarMd.h
    \brief A* related functions descriptions.
    \author Maeva Arlandis et Alexis Devillard
    \version 6.2
    \date 10 janvier 2017
*/


/*! \fn int astarMode(Map *L);
    \brief Generate simple A* behavior.
    \param L The labyrinth map structure.
*/
int cleverMode(Map *L);

void cleverMv(Map* L, int P,t_move* move);

int Max(Map *L,int depth,Movement* mv,int P);

int Min(Map *L,int depth,Movement* m,int P);//return the best this move could lead to

void initChilds(Movement *mv);
Movement * addChild(Movement *mv,int i);

Graph * initGraph(Map *L);
Graph * computeGraphRot(Graph * graph, int type, int value);

Movement *initMovement(Movement *parent,int P,int moveType,int x, int y);
Movement *initMovementRot(Movement *parent,int P,int moveType,int value);
void freeMovement(Movement *mv);

int evaluate(Map *L,Movement *M,int P);

int distMtoG(Map *L,Movement *M,int P, int G);
int astarDistMtoG(Map *L,Movement *M,int P, int G);Node *newNodeC(Movement *M,int x, int y,Node * parent,char ** nds); //create a new case for a neighbour of c
Node * addNeighC(Movement *M,Node* opL,char** nds);// try to create a node for each neighbor, and add them to the open list.
int distNtoPC(Movement *M,int P,Node *N);


void dijkstraMarking(Graph *G,int x, int y);

DijkstraNode * addNeighD(Graph *G,DijkstraNode* opL,char** nds);// try to create a node for each neighbor, and add them to the open list.

DijkstraNode *newNodeD(Graph *G,int x, int y,int costParent,char ** nds); //create a new case for a neighbour of c

DijkstraNode * addToListCost(DijkstraNode *N1,DijkstraNode* NtoAdd);//add a node to a list sort cost increasing

Movement *addToListMIN(Movement * M1,Movement * NtoAdd);
Movement *addToListMAX(Movement * M1,Movement * NtoAdd);




#endif