Page "Shannon switching game" Paragraph 2
from
Wikipedia
The game is played on a finite graph with two special nodes, A and B.
Each edge of the graph can be either colored or removed.
The two players are called Short and Cut, and alternate moves.
On Cut's turn, he deletes from the graph a non-colored edge of his choice.
On Short's turn, he colors any edge still in the graph.
If Cut manages to turn the graph into one where A and B are no longer connected, he wins.
If Short manages to create a colored path from A to B, he wins.
Page 1 of 1.
2.199 seconds.