In week 3. The lecturer explained about the understanding of different approaches and techniques in AI. The mathematical approaches of algorithms I learnt in that particular week were Best-First search, A* search, and Heuristic.

Unlike second week where We were taught of using Uninformed Search, this week the lecturer taught us about informed search, a search which use domain knowledge to guide selection of the best path to continue the search. And that search is called heuristic technique.

The other technique is called Best-First search, this algorithms use a technique which sort all the nodes list and go through the next node by picking the smallest weight and as the algorithms continue, it increases the values by adding all the weights of the nodes that have been visited.

The last searching algorithms was A* Search Algorithms. this particular search algorithms is simply to evaluate whether the estimated cost to get to goal from node n is admissible or not. By drawing a table and input all the h(n),g(n),f(n),h*(n) and compare between h(n) and h*(n). If the value of h(n) is bigger than h*(n), then h is simply not admissible.