We saw that the straight-line distance heuristic leads greedy best-first search astray on the problem of going from lasi to Fagaras. However, the heuristic is perfect on the opposite problem: going from Fagaras to lasi. Are there problems for which the heuristic is misleading in both directions?
Answer to relevant QuestionsInvent a heuristic function for the 8-puzzle that sometimes overestimates, and show how it can lead to a suboptimal solution on a particular problem. (You can use a computer to help if you want.) Prove that, if h never ...Sometimes there is no good evaluation function for a problem, but there is a good comparison method: a way to tell whether one node is better than another, without assigning numerical values to either. Show that this is ...How many solutions are there for the map-coloring problem inFigure?Show how a single ternary constraint such as “A + B = C” can be turned into three binary constraints by using an auxiliary variable. You may assume finite domains. Next, show how constraints with more than three ...Describe or implement state descriptions, move generators, terminal tests, utility functions, and evaluation functions for one or more of the following games: Monopoly, Scrabble, bridge (assuming a given contract), and poker ...
Post your question