In: Computer Science
write a comprehensive report on Search Techniques covered and discussed in class with an example (working example) of each of the searches DFS, BFS, DFS with Iterative Deepening, A* search, Greedy Best First, Hill Climbing, Brute Force, British Museum Problem, and Genetic Algorithms. Each of the example must be hand written and part of the report.
The different algorithms are explained in the attached images. The images are named in the order of pages. I could answer only four algorithms within the allotted time.