Tag: depth first
4. Search: Depth-First, Hill Climbing, Beam
Search trees Search trees represent all the possibilities to search for the quickest path without coming back to previous paths. They are particularly used for quickest paths on maps with nodes (intersections), but not exclusively. They are primarily about choices, and finding the best sequence of choices. British Museum Algorithm = complete expansion of all paths Depth…