Which statement about classical state-space search for problem solving in artificial intelligence is NOT true?
Search algorithms cannot use iteration or repeatedly expand nodes.
The claim that search algorithms cannot use iteration is false. Standard tree-search repeatedly removes a frontier node, tests for a goal and expands successors. Informed search can use heuristic estimates, and a successful plan can specify an action sequence. Deterministic problems may use precise transition rules; imprecise knowledge is not a necessary feature of every AI search problem.
Important Questions from Artificial Intelligence - Teaching
- Which of the following best describes Generative AI?
- Which one of the following is not matching the broad functionality?
Which of the following languages is suitable for artificial intelligence?
- Which organization developed ChatGPT?
Match the search algorithms to the properties below. Assume finite branching, positive step costs, and admissible heuristics for the A* variants.
List I:
(A) Greedy best-first tree search without cycle checking
(B) Standard A* retaining its search frontier
(C) Recursive best-first search (RBFS)
(D) Simplified memory-bounded A* (SMA*)
List II:
(I) Uses \(O(bd)\) memory, where \(b\) is the branching factor and \(d\) is the maximum retained path depth.
(II) Can be incomplete on a finite state graph because it may repeatedly traverse a cycle.
(III) Finds an optimal solution if sufficient memory can retain an optimal path; otherwise finds the best solution reachable within the memory bound.
(IV) May require exponential time and memory in the worst case.
Choose the correct answer from the options given below.
