A* finds the shortest path by combining actual cost g(n) with a heuristic estimate h(n). For word ladders and DNA mutations, the Hamming distance counts differing characters, guiding the search toward the goal while guaranteeing optimality.