Nicht angemeldet. · Kennwort vergessen · Registrieren

 Mitglied seit 04/2018 15 Beiträge 02.02.2019, 23:08   #1   Betreff: Assignment 4: Solution Heuristics Regarding the presented heuristics in the solution. Won't both heuristics be fooled by an initially fruitful looking subtree? Asking in terms of optimality ... (see attatched image) Der Autor hat eine Datei an diesen Beitrag angehängt: 20190202_230559.jpg 233,1 kBytes Du hast keine Berechtigung, diese Datei zu öffnen.
 Mitglied seit 11/2016 14 Beiträge 03.02.2019, 10:29   #2   +3 tyr, lu60ruhy, Jonas S Yes. Initially. But the deeper the heuristic explores the promising path, the more it will cost. So it will start looking for cheaper paths than the ones it already traversed. E.g. at depth X+1 (at most) the heuristic will start searching the unexplored paths, because costs are the same as going deeper inside the already half-explored ones. And finally it'll settle for the better path. Just try a test run with a small tree. When do you think will the heuristic stop exploring the right side in your example? “Success is not final, failure is not fatal: it is the courage to continue that counts.” – Winston Churchill I copied that from a google search to look smarter.
 Mitglied seit 04/2018 15 Beiträge 03.02.2019, 11:18   #3   Thank you for the answer - if I understand correctly, A* will start exploring the left side of my example tree as soon as it is through the cherries (level X+1). It will stop proceeding on the right side and focus solely on the left, as soon as the left side has turned up at least one cherry more than the right side has. Is my assessment accurate? "You can't connect the dots looking forward; you can only connect them looking backwards." - Steve Jobs (but probably not in the context of tree traversals ... )