Greedy Best-First Search, f(n) = h(n), Uniform Cost Search, f(n) = g(n), A* Search, f(n) = g(n) + h(n), Beam Search, Keeps only k best nodes, Weighted A*, f(n) = g(n) + w × h(n), SMA*, Memory-bounded A*, Admissible Heuristic, Never overestimates cost, Consistent Heuristic, Satisfies triangle inequality, Frontier, Nodes waiting to be expanded, RBFS, Stores only current path

Match the Algorithm with its Evaluation Function

etter

Visuell stil

Aktivitetsinnstillinger

Ledertavle

Bytt mal

Gjenopprett automatisk lagring: ?