/*
 * IAEngine.h
 *
 *  Created on: 17 juin 2018
 *      Author: isen
 */

#ifndef IAENGINE_H_
#define IAENGINE_H_

typedef struct noeud
{
    int compteur, min, cout_f; //

    int ParentX;
    int ParentY;
      // 'adresse' du parent (qui sera toujours dans la map fermée)
}NOEUD;


int FindShortestPath(int Player1PositionX, int Player1PositionY, int Player2PositionX, int Player2PositionY);
//int IAEngine(PLAYER * player1, PLAYER * player2);
int IAEngine(ARENA_H_TILE* arena,PLAYER * player1, PLAYER * player2);
int distance(int x1, int y1, int x2, int y2);
//int CalculatePath(ARENA_H_TILE* arena,int PositionX, int PositionY,PLAYER  * player1, int compteur, int distance,int min);
//int CalculatePath(ARENA_H_TILE* arena,int posX, int posY,NOEUD * n1,PLAYER  * player1, int compteur, int dist,int min);

NOEUD * CalculatePath(ARENA_H_TILE* arena,int posX, int posY,NOEUD * n1,PLAYER  * player1,PLAYER  * player2, int compteur, int dist,int min);
//NOEUD * CalculatePath(ARENA_H_TILE* arena,int posX, int posY,NOEUD * n1,PLAYER  * player1, int compteur, int dist,int min);
#endif /* IAENGINE_H_ */