I had learnt about DFS, BFS, UCS, DLS, IDS. DFS(Depth First Search) is where the searching algorithm will go through vertically of the search tree. BFS(Breadth First Search) is where the searching algorithm will go through horizontally or all the parents or adjacent nodes before going to child nodes. UCS(Uniform-Cost Search) is very similar to how Djikstra Algorithm work. It measures the lowest cost to each node from the original node until it found the goal node. DLS(Depth Limited Search) is very similar to DFS yet with limited depth based on the user. This is to prevent any looping that may cause unlimited repetition of the algorithm. IDS(Iterative Deepening Search) is very similar to DLS yet the depth increases incrementally through the use of multiple repetition until it reaches the final depth.