#ifndef DATA$\_$TYPES$\_$H

#define DATA$\_$TYPES$\_$H

$//====================$ WRITE YOUR OPTIONAL DATA TYPES IF YOU NEED $=============$

enum CITIES

$\{$

Arad, Bucharest, Craiova, Drobeta, Eforie,

Fagaras, Giurgiu, Hirsova, Iasi, Lugoj,

Mehadia, Neamt, Oradea, Pitesti, Rimnicu$\_$Vilcea,

Sibiu, Timisoara, Urziceni, Vaslui, Zerind

$\}$;

$//======$ WRITE YOUR COMPULSORY $($BUT SPECIFIC TO THE PROBLEM$)$ DATA TYPES $=======$

enum ACTIONS $//$ All possible actions

$\{$

Go$\_$Arad, Go$\_$Bucharest, Go$\_$Craiova, Go$\_$Drobeta, Go$\_$Eforie,

Go$\_$Fagaras, Go$\_$Giurgiu, Go$\_$Hirsova, Go$\_$Iasi, Go$\_$Lugoj,

Go$\_$Mehadia, Go$\_$Neamt, Go$\_$Oradea, Go$\_$Pitesti, Go$\_$Rimnicu$\_$Vilcea,

Go$\_$Sibiu, Go$\_$Timisoara, Go$\_$Urziceni, Go$\_$Vaslui, Go$\_$Zerind

$\}$;

typedef struct State

$\{$

enum CITIES city;

float h$\_$n; $//$ Heuristic function

$\}$State;

$//==================$ YOU DO NOT NEED TO CHANGE THIS PART $======================$

enum METHODS

$\{$

BreastFirstSearch $=1,$ UniformCostSearch $=2,$ DepthFirstSearch $=3,$

DepthLimitedSearch$=4,$ IterativeDeepeningSearch $=5,$ GreedySearch $=6,$

AStarSearch $=7,$ GeneralizedAStarSearch $=8$

$\}$;

$//$ This struct is used to determine a new state and action in transition model

typedef struct Transition$\_$Model

$\{$

State new$\_$state;

float step$\_$cost;

$\}$Transition$\_$Model;

typedef struct Node

$\{$

State state;

float path$\_$cost;

enum ACTIONS action; $//$The action applied to the parent to generate this node

struct Node $*$parent;

int Number$\_$of$\_$Child; $//$ required for depth$-$first search algorithms

$\}$Node;

typedef struct Queue $//$ Used for frontier

$\{$

Node $*$node;

struct Queue $*$next;

$\}$Queue;

#endif change this code for $8$ puzzle game