⟩ A problem in a search space Is defined by a) Initial state b) Goal test c) Intermediate states d) All of the above
a) Initial state & b) Goal test
Explanation:
A problem has four components initial state, goal test, set of actions, path cost.
Question and Answer:
Home Artificial Intelligence Algorithms
- Share
Popular Answers:
* There is no answer to the above question yet.
More Questions for you:
List the types of linked list with aid of diagram?
Flexible CSPs relax on a) Constraints b) Current State c) Initial State d) Goal State
What are taken into account of state-space search? a) Post conditions b) Preconditions c) Effects d) Both b & c
Why the parsing is used? a) Interpretation b) Building a parse tree c) Recognition d) All of the mentioned
How many ways are available to solve the state-space search? a) 1 b) 2 c) 3 d) 4
what is software cycle? Give a diagrammatic representation?
Which is true regarding BFS in artificial intelligence algorithms?
How many states are available in state-space search? a) 1 b) 2 c) 3 d) 4
What is the main advantage of backward state-space search? a) Cost b) Actions c) Relevant actions d) All of the mentioned
Tell me what is meant by consistent in state-space search? a) Change in the desired literals b) Not any change in the literals c) No change in goal state d) None of the mentioned
