Skip to content
Kudos AI
enfrar

Heuristics and A*

Adding an estimate of the distance remaining; why greedy search is fast but not optimal; and the admissibility and consistency conditions that make A* provably optimal.

FoundationsModule 230 min · 120 XP
The same map searched twice: greedy takes the detour through the town that merely looks close, and A* - counting the cost already paid - takes the cheaper road.

This is a premium lesson

Sign in and enrol to read the full lesson, run the code, take the quiz, and earn XP toward the path badge.

Sign inCreate account
← Back to Search and Heuristics