Algorithm Learning Search Search from status tree/game tree Each node is a state Each edge is a state transition, e.g., move Iterative Deepening DFS Uninform-Cost Search Choose the lowest cost expandable node