Revision as of 14:10, 26 May 2006 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits →Relation to uniform-cost search ← Previous edit		Revision as of 21:14, 26 May 2006 edit undo Regnaron~enwiki (talk \| contribs) 82 edits →Relation to uniform-cost search Next edit →
Line 97: :Dijkstra's is a special case in the mathematical sense, this has nothing to do with historical derivation. [[User:Qwertyus\|Qwertyus]] 14:10, 26 May 2006 (UTC) : Well, use A* with the heuristics h(x) = 0 for all x. (meaning using no heuristics at all) : What you will get is just Dijkstras Algorithm. So in this sense Dijkstra is a special case of A* (namely one where the heuristcs is 0 for all nodes) [[User:Regnaron\|Regnaron]] 21:14, 26 May 2006 (UTC)

Talk:A* search algorithm: Difference between revisions