Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

M

Madhu

🎓 Tutor II ⭐ 12.07K Points

📊 Artificial Intelligence and Robotics (AIR)

Q. Which of the following statement(s) is true for Sparse-Memory Graph Search (SMGS)?

(A) the boundary is defined as those nodes in closed that have at least one successor still in open
(B) the nodes in closed that are not on the boundary are in the kernel
(C) the number of relay nodes on each path is exactly one.
(D) both a & b

💬 Discuss

✅ Correct Answer: (D) both a & b

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

400

Total Visits

📽️

3 y ago

Published

🎖️

Madhu

Publisher

📈

86%

Success Rate