Q. Which of the following conditions must hold for a solution to a CSP?
Correct Answer - Option(B)
Q. Which of the following are Informed search algorithms?
Q. ________ algorithm keeps track of k states rather than just one.
Q. Operator PUTDOWN has which of the following sequence of actions?
Q. Backward State Space Planning (BSSP)________________
Q. What is the heuristic cost of SOLVED nodes in AO* example?
Q. effectsâș (a) in Forward State Space Planning denotes _____________
Q. The working memory of the problem solver is like its ___________
Q. Frame problem in STRIPS Domain can be solved by ________
Q. If there is a solution, breadth first search is _______________to find it
Q. Which property asks that the algorithm is locally admissible?
Discusssion
Login to discuss.