As pointed by Bernhard, when running Lemke SF algorithm for the 'absent minded driver', gte enters an infinite loop. The reason behind that is probably that Lemke can't be used for games with imperfect recall, and that in this particular case it fails to detect that. The functionality that tests that is probably under gte/lib-algo/src/lse/math/games/treeSequenceForm.java.
An example of the absent minded game, which fails, is the following:
As pointed by Bernhard, when running Lemke SF algorithm for the 'absent minded driver', gte enters an infinite loop. The reason behind that is probably that Lemke can't be used for games with imperfect recall, and that in this particular case it fails to detect that. The functionality that tests that is probably under gte/lib-algo/src/lse/math/games/treeSequenceForm.java.
An example of the absent minded game, which fails, is the following: