I learned firstly about the Informed Search. Compared to uninformed search, informed search base the search from heuristics, which is informed guesses. Informed search have knowledge with regards to the entire information about the domain that is being searched. There are best-first search, greedy search, A search, A* search and lastly partial search. Secondly, I learned about Local Search. In comparative, complete search analyzes every node in the searched domain, yet local search only search or compare the neighbors of a node that is specified. This is done through a method called hill climbing (maximize search) or valley finding (minimize search). There is also a semi global approach, whereby local search method is used on the entire domain search. Through this, there are methods namely, Simulated Annealing and Genetic Algorithms.