AI - Einführung, Suche & Exploration, Steering & Control, Path Finding  

Suchalgorithmen

Wie funktioniert der Hill-Climbing Algorithmus?

Greedy Local Search
 
HillClimbing(Nstart)
    current := Nstart
    do
        continue := false
        foreach n in expand(current)
            if v(n) > v(current)
                current := n
                continue := true
    while (continue)
    return current

Diskussion