Content deleted Content added
m Is there an example? |
|||
Line 61:
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)
: ''Only one list of visited nodes needs to be maintained, so that nodes are not unnecessarily revisited.''
Doesn't this wording seem to imply a closed list rather than an open list? Also, when I said 'backtracking' I was referring to the situation where a search hits a dead-end (where the remaining distance is low but there is no valid path) and the choice has to be made as to which open list entry to expand next... I could really do with an example of a valid, monotonic heuristic in action to understand what's going on. Thanks. &mdash [[User:Lee J Haywood|Lee J Haywood]] 08:48, 29 August 2005 (UTC)
| |||