Problem
• Assume the state space graph of a seach problem is a full binary tree of depth 3 (with 8 leaf nodes). One of the leaf nodes is chosen at random to be the goal node. What is the average number of nodes expanded by DFS?
• In the above problem, if each leaf node is chosen to be a goal node with probability = 1/2 what is the average number of nodes expanded by DFS?