How can I prove that if a game is finite, then it always has a winning strategy for every node in a graph.

Question

Any node can be the starting node and the game is finite (i.e no possible infinite loop). I need to show that for such game there exists a winning strategy for either verifier or the falsifier for every starting node.