#include

#include

#include "GRAPH$\_$SEARCH.h$"$

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

int main$()$

$\{$

Node root, $*$goal;

State $*$goal$\_$state $=$ NULL;

enum METHODS method;

int Max$\_$Level, level;

float alpha;

$//$ This part must be updated if a new algorithm is added.

printf$("1-->$ Breast$-$First Search

$")$;

printf$("2-->$ Uniform$-$Cost Search

$")$;

printf$("3-->$ Depth$-$First Search

$")$;

printf$("4-->$ Depth$-$Limited Search

$")$;

printf$("5-->$ Iterative Deepening Search

$")$;

printf$("6-->$ Greedy Search

$")$;

printf$("7-->$ A$*$ Search

$")$;

printf$("8-->$ Generalized A$*$ Search

$")$;

printf$("$Select a method to solve the problem: $")$;

scanf$("\%$d$",$ &method$)$;

if$($method$==$DepthLimitedSearch$)\{$

printf$("$Enter maximum level for depth$-$limited search : $")$;

scanf$("\%$d$",$ &Max$\_$Level$)$;

$\}$

if$($method$==$GeneralizedAStarSearch$)\{$

printf$("$Enter value of alpha for Generalized A$*$ Search : $")$;

scanf$("\%$f$",$ &alpha$)$;

$\}$

$//$ Creating the root node $...$

root.parent $=$ NULL;

root.path$\_$cost $=0$;

root.action $=$ NO$\_$ACTION; $//$ The program will not use this part. $($NO$\_$ACTION$-->0)$

root.Number$\_$of$\_$Child $=0$;

printf$("========$ SELECTION OF INITIAL STATE $===============$

$")$;

root.state $=*($Create$\_$State$())$;

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

$\{$

printf$("========$ SELECTION OF GOAL STATE $===============$

$")$;

goal$\_$state $=$ Create$\_$State$()$;

$\}$

if$($method$==$GreedySearch $||$ method$==$AStarSearch $||$ method$==$GeneralizedAStarSearch$)\{$

root.state.h$\_$n $=$ Compute$\_$Heuristic$\_$Function$($&$($root$.$state$),$ goal$\_$state$)$;

if$($PREDETERMINED$\_$GOAL$\_$STATE$)$

goal$\_$state$->$h$\_$n $=0$;

$\}$

switch$($method$)$

$\{$

case BreastFirstSearch:

case GreedySearch:

goal $=$ First$\_$GoalTest$\_$Search$\_$TREE$($method$,$ &root, goal$\_$state$)$; break;

case DepthFirstSearch:

case DepthLimitedSearch:

goal $=$ DepthType$\_$Search$\_$TREE$($method$,$ &root, goal$\_$state, Max$\_$Level$)$; break;

case IterativeDeepeningSearch:

for$($level$=0$; TRUE ;level$++)\{$

goal $=$ DepthType$\_$Search$\_$TREE$($method$,$ &root, goal$\_$state, level$)$;

if$($goal$!=$FAILURE$)\{$

printf$("$The goal is found in level $\%$d$.$

$",$ level$)$;

break;

$\}$

$\}$

break;

case UniformCostSearch:

case AStarSearch:

case GeneralizedAStarSearch:

goal $=$ First$\_$InsertFrontier$\_$Search$\_$TREE$($method$,$ &root, goal$\_$state, alpha$)$; break;

default:

printf$("$ERROR: Unknown method.

$")$;

exit$(-1)$;

$\}$

Show$\_$Solution$\_$Path$($goal$)$;

return $0$;

$\}$ change this code for $8$ puzzle game