Answer Happy

Score Section I: True/False (18 Points) Write True (T) or False (F) before each question. 1. In a state search tree, each state occurs only once. 2. An A* algorithm will stop if a goal-state node enters the fringe. 3. A heuristic h is admissible if 0≤h(n) ≤h (n) where h (n) is the true cost to a nearest goal. 4. Given a choice of variable, we usually choose the least constraining value, i.e., the one that rules out the fewest values in the remaining variables. 5. A solution to search problem is a sequence of actions which transforms the start state to a goal state. 6. An arc X→ Y is consistent if and only if for every y in the tail there is some x in the head which could be assigned without violating a constraint.