2023 Term 1 · Afternoon
24 questions from 23T1_an.yaml. Answer everything, then hit "Check answers".
Worked solutions, step by step ↗Stuck on a question? Open its full solution — traces, visuals, shortcuts.
24 questions
A MoveGen for a state space where S is the start node and G is the goal node is shown in the table. The MoveGen function returns nodes in the order as shown in the table. Use DFS and BFS to find a path from S to G. Note: DFS and BFS inspect only new nodes.
| X | MoveGen(X) | |
|---|---|---|
| S | [A, C] | |
| A | [B, C, D, S] | |
| B | [A, D, E] | |
| C | [A, D, S] | |
| D | [A, B, C, E, G] | |
| E | [B, D, G] | |
| G | [D, E] |
What is the path found by DFS? Enter the path as a comma separated list.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format: S,X,Y,Z
1 / 8