#C code to demonstrate BFS, DFS, A* algorithms in AI graph search
List of source files: 1.) code.c
Compilation command: cc code.c -lm
Heuristic: The Heuristic is the number of 'W' present before the 1st occurence of 'B'. For ex. WBxBW has priority 1 WWBxWBB has priority 2 BWWxBWB has priority 0