Pathfinding

There is a map included which shows start and finish. The programmer must determine the best path across the mixed surface terrain using at least two methods of pathfinding. A) using the "best first search" technique, in conjunction with map pre-processing (forward and reverse scan methods) plot a path from the start square to the goal square avoiding major obstacles. B) using "depth first with evaluator function" method, determine a path from the start square to the goal square. expand each node (square) of the search tree according to an evaluator function. An example of an evaluator to use could be: Evaluator = (manhattan distance to goal)*(neighbour cost value) The minimum evaluation value would be the most favourable node (square) to move to. ## Deliverables I require a copy of the map with your path clearly marked along with a breakdown of your calculation process. Also I require the program code which you used to process your map. If possible please submit an analysis of the two methods, their effectiveness and complexity. ## Platform Windows 9x