Implement A* algorithm for the following problems:
8 puzzle
Missionaries and Cannibals
Black and White tiles
3 black and 3 white tiles are given in some initial configuration. Aim is to arrange the tiles such that all the white tiles are to the left of all the black tiles. The cost of a translation is 1 and cost of a jump is 2.

Specifications:
Try different heuristics and compare with baseline case, i.e., the breadth first search.
Violate the condition h <= h*. See if the optimal path is still found. Observe the speedup.

Other guidelines
Assignment is expected to be done in groups of maximum four. 
Implementation can be done in any language. 
Although a clean and crisp implementation is expected, grading will be more based on rigour of analysis done and demoed(using graphs etc).