This week we studied the informed searches. In the informed searches, the functions possesses heuristic value alongside its path cost. In this session we learned and practiced on multiple algorithms such as A*, greedy, and genetic, which means that we continued learning into further detail of the A* algorithm after we have implemented the coding aspect of it in the second week during the lab class session.

The A* algorithm takes into consideration not only the heuristic value, but also its path cost unlike the greedy algorithm, which only considers the heuristic value. We also studied local search that includes hill climbing, which searches neighbors and check the most optimal value from the results. The genetic algorithm that we also practiced during this session is a trial and error method that occurs until the best solution is found.