1 / 7

G5BAIM Artificial Intelligence Methods

G5BAIM Artificial Intelligence Methods. Hill Climbing. Graham Kendall. 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

helen
Télécharger la présentation

G5BAIM Artificial Intelligence Methods

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. G5BAIMArtificial Intelligence Methods Hill Climbing Graham Kendall

  2. Hill Climbing

  3. 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

  4. 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

  5. Hill Climbing

  6. Hill Climbing

  7. G5BAIMArtificial Intelligence Methods End of Hill Climbing Graham Kendall

More Related