Planning: Equivalent to route-planning on an abstract graph, you can let edges represent actions (and their cost), nodes represent states, we want to find a path between (start node, goal node).
Proving a mathematical theorem: You can recursively break the problem down into proving lemmas (and lemmas for those lemmas...) which together prove the theorem
Learning a skill: You break a skill into smaller skills then integrate them back into a whole. Examples in programming: Layers of abstraction in a neural net, reward shaping.
Basically any problem with a graph, network, etc. ;)
Planning: Equivalent to route-planning on an abstract graph, you can let edges represent actions (and their cost), nodes represent states, we want to find a path between (start node, goal node).
Proving a mathematical theorem: You can recursively break the problem down into proving lemmas (and lemmas for those lemmas...) which together prove the theorem
Learning a skill: You break a skill into smaller skills then integrate them back into a whole. Examples in programming: Layers of abstraction in a neural net, reward shaping.
Basically any problem with a graph, network, etc. ;)