Content deleted Content added
Monotonicity |
|||
Line 59:
Would someone add an explanation of why this is the case, i.e. how an algorithm might be implemented for a monotonic heuristic?
[http://www.cs.unm.edu/~terran/classes/cs427-s03/lectures/l05_feb04/notes.pdf This document] says that there is no need for a closed list, but the article implies that the open list isn't necessary either. It's not obvious how the backtracking would work. Thanks. — [[User:Lee J Haywood|Lee J Haywood]] 19:13, 28 August 2005 (UTC)
You don't really backtrack. Every time you reach a node, you have found the shortest path to that node. So, you just want to make sure you don't revisit nodes. I guess it would make sense to consider the mechanism that does that to be an "open list", even though there's no "closed list" to contrast it with. I'll rephrase that. [[User:Rspeer|RSpeer]] 03:20, August 29, 2005 (UTC)
| |||