Scribd Logo
Upload

Welcome to Scribd!

  • 8 views

    G5Baim Artificial Intelligence Methods: Graham Kendall

    Uploaded by

    Khurram Abbas
    The document describes the hill climbing algorithm, which starts with a random solution, considers neighboring solutions, moves to the highest valued neighbor, and repeats this process of moving to the best neighbor until it reaches a state where all neighbors are of lower value, at which point it returns the current state as the solution. The key steps are to pick a random starting point, choose the highest valued neighbor of the current state, move to that neighbor, and repeat this process of always moving to the best neighbor until no better solutions exist among the neighbors.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd

    G5Baim Artificial Intelligence Methods: Graham Kendall

    Uploaded by

    Khurram Abbas
    8 views7 pages
    The document describes the hill climbing algorithm, which starts with a random solution, considers neighboring solutions, moves to the highest valued neighbor, and repeats this process of moving to the best neighbor until it reaches a state where all neighbors are of lower value, at which point it returns the current state as the solution. The key steps are to pick a random starting point, choose the highest valued neighbor of the current state, move to that neighbor, and repeat this process of always moving to the best neighbor until no better solutions exist among the neighbors.

    Original Description:

    Original Title

    hillclimbing

    Copyright

    © © All Rights Reserved

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes the hill climbing algorithm, which starts with a random solution, considers neighboring solutions, moves to the highest valued neighbor, and repeats this process of moving to the best neighbor until it reaches a state where all neighbors are of lower value, at which point it returns the current state as the solution. The key steps are to pick a random starting point, choose the highest valued neighbor of the current state, move to that neighbor, and repeat this process of always moving to the best neighbor until no better solutions exist among the neighbors.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    8 views7 pages

    G5Baim Artificial Intelligence Methods: Graham Kendall

    Uploaded by

    Khurram Abbas
    The document describes the hill climbing algorithm, which starts with a random solution, considers neighboring solutions, moves to the highest valued neighbor, and repeats this process of moving to the best neighbor until it reaches a state where all neighbors are of lower value, at which point it returns the current state as the solution. The key steps are to pick a random starting point, choose the highest valued neighbor of the current state, move to that neighbor, and repeat this process of always moving to the best neighbor until no better solutions exist among the neighbors.

    Copyright:

    © All Rights Reserved
    Download as PPT, PDF, TXT or read online from Scribd
    Download as ppt, pdf, or txt
    of 7

    G5BAIM

    Artificial Intelligence Methods


    Graham Kendall
    Hill Climbing
    G5BAIM Hill Climbing

    Hill Climbing
    G5BAIM Hill Climbing

    Hill Climbing - Algorithm


    1. Pick a random point in the search space
    2. Consider all the neighbours of the
    current state
    3. Choose the neighbour with the best
    quality and move to that state
    4. Repeat 2 thru 4 until all the
    neighbouring states are of lower quality
    5. Return the current state as the solution
    state
    G5BAIM Hill Climbing

    Hill Climbing - Algorithm


    Function HILL-CLIMBING(Problem) returns a solution state
    Inputs:Problem, problem
    Local variables:Current, a node
    Next, a node
    Current = MAKE-NODE(INITIAL-STATE[Problem])
    Loop do
    Next = a highest-valued successor of Current
    If VALUE[Next] < VALUE[Current] then return Current
    Current = Next
    End
    G5BAIM Hill Climbing

    Hill Climbing
    G5BAIM Hill Climbing

    Hill Climbing
    G5BAIM
    Artificial Intelligence Methods
    Graham Kendall
    End of Hill Climbing

    You might also like