In this week’s session we studied about uninformed search. Some aspect of the uninformed search strategy is familiar to us as the uninformed search consists of Breadth First Search and Depth First Search. However we didn’t only recall on BFS and DFS in this session as we also learned more on the uninformed search strategies which are (BFS and DFS) FLS, UCS, and IDS.

These uninformed search strategies are used in order to search for results. A state graph has vertices and edges, as each state has its own path cost where these uninformed search strategies try to come up with an optimal result to reach its goal. And in order to practice and test our understandings, we were given an exercise to implement the uninformed search strategies that we learned in class.