#ifndef TREE$\_$SERACH$\_$H

#define TREE$\_$SERACH$\_$H

#include "data$\_$types.h$"$

$//====================$ WRITE YOUR OPTIONAL COMMANDS $===========================$

#define CITY$\_$NUMBER $20$

$//========$ YOUR COMPULSORY $($BUT SPECIFIC TO THE PROBLEM$)$ COMMANDS $============$

#define PREDETERMINED$\_$GOAL$\_$STATE $1//$ User will initially determine the goal state if it is true $(1)$

#define ACTIONS$\_$NUMBER $20//$ The number of all possible actions

#define MAX$\_$SEARCHED$\_$NODE $100000000//$ exit from the search process if it is exceeded

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

#define NO$\_$ACTION $0$

#define TRUE $1$

#define FALSE $0$

#define FAILURE NULL

$//=========$ YOUR COMPULSORY $($BUT SPECIFIC TO THE PROBLEM$)$ DECLARATIONS $=======$

State$*$ Create$\_$State$()$;

void Print$\_$State$($const State $*$const state$)$;

void Print$\_$Action$($const enum ACTIONS action$)$;

int Result$($const State $*$const parent$\_$state, const enum ACTIONS action, Transition$\_$Model $*$const trans$\_$model$)$;

float Compute$\_$Heuristic$\_$Function$($const State $*$const state, const State $*$const goal$)$;

int Goal$\_$Test$($const State $*$const state, const State $*$const goal$\_$state$)$;

$//=======$ YOU DO NOT NEED TO CHANGE THIS COMPULSORY DECLARATIONS EXCEPT INSERTION OF THE GENERALIZED A$*$ ALGORITHM$==============$

Node$*$ First$\_$GoalTest$\_$Search$\_$TREE$($const enum METHODS method, Node $*$const root, State $*$const goal$\_$state$)$;

Node$*$ First$\_$InsertFrontier$\_$Search$\_$TREE$($const enum METHODS method, Node $*$const root, State $*$const goal$\_$state, float alpha$)$; $//$ Update for THE GENERALIZED A$*$

Node$*$ DepthType$\_$Search$\_$TREE$($const enum METHODS method, Node $*$const root, State $*$const goal$\_$state, const int Max$\_$Level$)$;

Node$*$ Child$\_$Node$($Node $*$const parent, const enum ACTIONS action$)$;

Queue$*$ Start$\_$Frontier$($Node $*$const root$)$;

int Empty$($const Queue $*$const frontier$)$;

Node$*$ Pop$($Queue $**$frontier$)$;

void Insert$\_$FIFO$($Node $*$const child, Queue $**$frontier$)$;

void Insert$\_$LIFO$($Node $*$const child, Queue $**$frontier$)$;

void Insert$\_$Priority$\_$Queue$\_$UniformSearch$($Node $*$const child, Queue $**$frontier$)$;

void Insert$\_$Priority$\_$Queue$\_$GreedySearch$($Node $*$const child, Queue $**$frontier$)$;

void Insert$\_$Priority$\_$Queue$\_$A$\_$Star$($Node $*$const child, Queue $**$frontier$)$;

void Insert$\_$Priority$\_$Queue$\_$GENERALIZED$\_$A$\_$Star$($Node $*$const child, Queue $**$frontier$,$ float alpha$)$; $//$ Update for THE GENERALIZED A$*$

void Print$\_$Frontier$($Queue $*$const frontier$)$;

void Show$\_$Solution$\_$Path$($Node $*$const goal$)$;

void Print$\_$Node$($const Node $*$const node$)$;

int Level$\_$of$\_$Node$($Node $*$const node$)$;

void Clear$\_$All$\_$Branch$($Node $*$node$,$ int $*$Number$\_$Allocated$\_$Nodes$)$;

void Clear$\_$Single$\_$Branch$($Node $*$node$,$ int $*$Number$\_$Allocated$\_$Nodes$)$;

void Warning$\_$Memory$\_$Allocation$()$;

int Compare$\_$States$($const State $*$const state$1,$ const State $*$const state$2)$;

Node$*$ Frontier$\_$search$($Queue $*$const frontier, const State $*$const state$)$;

void Remove$\_$Node$\_$From$\_$Frontier$($Node $*$const old$\_$child, Queue $**$const frontier$)$ ;

$//====================$ WRITE YOUR OPTIONAL DECLARATIONS $=======================$

#endif change this code for $8$ puzzle