Скачать с ютуб Breadth First Search (BFS)-Artificial Intelligence-Unit-1-Problem solving-Uninformed Searching в хорошем качестве

Breadth First Search (BFS)-Artificial Intelligence-Unit-1-Problem solving-Uninformed Searching

Unit – 1 – Problem Solving Uninformed Searching Strategies Uninformed (blind, brute-force) search algorithm generates the search tree without using any domain specific knowledge. No additional information about states beyond that provided in the problem definition. These algorithms generate successors using the successor function Knlowedge about goal state (knowledge about a goal state and a non-goal states) No information about the path cost from the current state to goal state. Types of Uninformed searching algorithms Breadth-First Search Uniform Cost Search Depth First Search Depth Limited Search Iterative Deepening Search Bi-directional Search Breadth-First Search (BFS) The root node is expanded first and then all the successors of the nodes are expended next, and their successors and so on. In general, all the nodes at a given depth are expanded in the search tree before any node at the next level are expanded. Mark any node as start (initial) node Explore and traverse un-visited nodes adjacent to starting node Mark nodes as completed and move to next adjacent and un-visited node. Step 0: A Step 1: A,B Step 2: A,B,C Step 3: A,B,C,D …. Completeness: Yes (if b is finite), the shallowest solution is returned Time Complexity: b+b2+b3+… +bd = O(bd) Time requirement is still a major factor Space Complexity: O (bd) (keeps every node in memory) Space is the bigger problem (more than time) Optimal: Yes if step costs are all identical or path cost is a nondecreasing function of the depth of the node Subscribe this channel, comment and share with your friends. For Syllabus, Text Books, Materials and Previous University Question Papers and important questions Follow me on Blog : https://dsumathi.blogspot.com/ Facebook Page : https://www.facebook.com/profile.php?... Instagram :   / dsumathiphd