Scribd Logo
Upload

Welcome to Scribd!

  • Simple Search Algorithm: S Q Q (S) Visited (S) Q X Q X X X Q X Visited Q X

    Uploaded by

    Ahsan Ramzan
    16 views1 page
    This document outlines a simple search algorithm that begins with an initial start state in its queue. It repeatedly removes the first node from the queue, checks if it is the goal state, and if not, adds its children that have not been visited to the queue and visited list. This continues until the goal state is found or the queue is empty, indicating no solution exists.

    Original Description:

    Original Title

    AI_Lecture_06.pdf

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document outlines a simple search algorithm that begins with an initial start state in its queue. It repeatedly removes the first node from the queue, checks if it is the goal state, and if not, adds its children that have not been visited to the queue and visited list. This continues until the goal state is found or the queue is empty, indicating no solution exists.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    16 views1 page

    Simple Search Algorithm: S Q Q (S) Visited (S) Q X Q X X X Q X Visited Q X

    Uploaded by

    Ahsan Ramzan
    This document outlines a simple search algorithm that begins with an initial start state in its queue. It repeatedly removes the first node from the queue, checks if it is the goal state, and if not, adds its children that have not been visited to the queue and visited list. This continues until the goal state is found or the queue is empty, indicating no solution exists.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Simple Search Algorithm

    Let S be the start state


    1. Initialize Q with the start node Q=(S) as only
    entry; set Visited = (S)
    2. If Q is empty, fail. Else pick node X from Q
    3. If X is a goal, return X, we’ve reached the
    goal
    4. (Otherwise) Remove X from Q
    5. Find all the children of node X not in Visited
    6. Add these to Q; Add Children of X to Visited
    7. Go to Step 2

    You might also like