[tromp]

Cooperative games still allow a distinction between winning and losing moves. A winning move is one where the resulting subgame still has a solution. A losing move is one where the resulting subgame has no solution.

In this game, looking only at the parities, all moves are reversible, so every move preserves the property of having a solution. For an even number of nodes, all moves in all positions are winning. And for an even number of nodes, all moves in all positions are losing.

[bena]

Yes, but before that person had an even number of handshakes, so shaking their hand gets them to odd. But at the expense of putting him at even. At worst, it's a neutral move.

And like I said, it really depends on the other rules which are never explicitly stated.

But I have a sneaking suspicion that discussing the game is arguing the metaphor.

The game is just there to help us get to the realization that graphs with an even number of vertices can have an odd number of edges, but a graph with an odd number of vertices can't have an odd number of edges.

[tromp]

> a graph with an odd number of vertices can't have an odd number of edges.

A 3 node graph can have 1 edge. The article is about a different notion of oddness, namely that all nodes have an odd degree.