Nim is a classic game where players take objects in piles. Nim-like games on graphs involve removing vertices or edges according to graph structure. These games connect to Sprague-Grundy theory. Each position has a Grundy number that determines its outcome.
Positions with Grundy number are losing. On graphs, computing Grundy numbers requires knowing the Grundy numbers of all successors. This is another form of backward induction.