Introduction to Search Algorithms in Artificial Intelligence, Explained Simply ->

L-02 https://youtu.be/UBn0c6Vzm8Y

Dear Rahul Jain ,

Search algorithms are one of the most important areas of Artificial Intelligence. This topic will explain all about the search algorithms in AI.

• Search: Searchingis a step by step procedure to solve a search-problem in a given search space. A search problem can have three main factors:Search Space: Search space represents a set of possible solutions, which a system may have. Start State: It is a state from where agent begins the search. Goal test: It is a function which observe the current state and returns whether the goal state is achieved or not.

Search tree: A tree representation of search problem is called Search tree. The root of the search tree is the root node which is corresponding to the initial state.

Actions: It gives the description of all the available actions to the agent.

Transition model: A description of what each action do, can be represented as a transition model.

Path Cost: It is a function which assigns a numeric cost to each path.

Solution: It is an action sequence which leads from the start node to the goal node.

Optimal Solution: If a solution has the lowest cost among all solutions..

https://www.javatpoint.com/search-algorithms-in-ai

Regards,

Shafagat

Properties of Search Algorithms:

For More details: Search Algorithms in AI - Javatpoint