Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is the transition model of a search problem?

  • A.The rule for deciding whether a state satisfies the goal
  • B.A description of the state resulting from each action
  • C.A record of the states the search has already visited
  • D.The cost associated with moving between two adjacent states

Answer: B

The transition model, sometimes written as a successor function, says what each action does in each state, and together with the initial state it defines the whole state space implicitly. Path cost, goal test and the explored set are separate components. Defining the space implicitly rather than enumerating it is what allows problems with astronomically many states to be posed at all, and it is why search algorithms generate rather than look up. The shared properties explain why these belong to one family, and the differences explain why more than one exists.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.