Class conducted on: 04-08-2024 and 11-08-2024 by Yash Shah

Basic Terminologies

Search problems involve an agent that is given an initial state and a goal state, and it returns a solution of how to get from the former to the latter. A navigator app uses a typical search process, where the agent (the thinking part of the program) receives as input your current location and your desired destination, and, based on a search algorithm, returns a suggested path. However, there are many other forms of search problems, like puzzles or mazes.

For more details check out: https://cs50.harvard.edu/ai/2024/notes/0/

Solving Search Problems

Solution: A series of steps that moves from the starting point to the goal.

Optimal Solution: The solution with the lowest cost among all possible solutions.

In search problems, we use nodes to store important information: