Computer Science 789 Online Algorithms Hint 5 for the Proof of the Game Graph Lemma The technique is to assume that there exists a winning path set strategy P, that is, where there is a constant K such that cost(alpha) is less than or equal to K( for every alpha in P. The potential is then somehow defined using P. The next hint is the biggy: the definition of the potential itself. But that's such a giveaway I don't want to put it up yet. First Hint Second Hint Third Hint Fourth Hint Fifth Hint Sixth Hint Back to Course Page Back to Assignment Page Back to Assignment 1