Firing games and greedoid languages
Matt Baker
In an earlier post, I described the dollar game played on a finite graph , and mentioned (for the “borrowing binge variant”) that the total number of borrowing moves required to win the game is independent of which borrowing moves you do in which order. A similar phenomenon occurs for the pentagon game described in […]
