Talk:A* search algorithm: Difference between revisions

Content deleted Content added
m The Pseudo-code: cleaned up my own suggestion, following AIMA
Line 175:
'''return''' ''partial_path''
'''else if''' the last node of ''partial_node'' is not in ''closed_list''
'''else'''
add ''partial_path''this node to ''closed_list''
'''foreach''' ''neighbor'' of the last node in ''partial_path''
'''var''' ''new_path'' := ''partial_path'' extended with ''neighbor''
'''if'''push ''new_path'' is not inon ''closed_listopen_list''
push ''new_path'' on ''open_list''
'''return''' FAILURE