This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 630: Homework 2 Solutions Key 1. (Combining heuristics) h 3 = max ( h 1 ,h 2 ). State h 1 h 2 h 3 A 10 8 10 B 12 9 12 C 12 14 14 D 6 4 6 E 7 9 9 F 7 7 7 G 2 1 2 H 10 9 10 2. (Hill-Climbing) In class, we saw how to solve the 4-queens problem using hill climbing search. Show the first two steps of a hill climbing search, with the following state of the 4-queens problem as the start state. As it was in the class, the neighbors of a given state are all of those states which are different from the current state in only one column (i.e. the queen of only one column can be moved). The cost of a state is defined as the number of pairs of queens that attack each other in that state (the cost of the start state specified below, for example, is 3). Indicate the cost of all the neighboring states of a given state (for this, you may use similar notation as was used in the slides). For each step, indicate which neighbor you have chosen to move to. You may break ties among neighboring states with equal cost arbitrarily. Remember you only need to show the first two steps....
View Full Document
- Spring '10