![]() # If it's the first time we've seen this child # For every child of those frontier positions # For every position on the last level (these farthest-away positions are the "frontier") ![]() While level_to_pos and (max_level=-1 or level < max_level): # (seen for the first time in the last iteration) # While there are still positions on the frontier Level_to_pos = # level 0 consists of a single solution """BF visit the entire puzzle graph, build level_to_pos, pos_to_level structures."""
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |