Revision as of 08:48, 29 August 2005 edit Lee J Haywood (talk \| contribs) 1,797 edits m Is there an example? ← Previous edit		Revision as of 09:45, 29 August 2005 edit undo Lee J Haywood (talk \| contribs) 1,797 edits mNo edit summary Next edit →
Line 64: : ''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.   — [[User:Lee J Haywood\|Lee J Haywood]] 08:48, 29 August 2005 (UTC)

Talk:A* search algorithm: Difference between revisions