Shannon switching game

The Shannon switching game is a connection game for two players, invented by American mathematician and electrical engineer Claude Shannon, the "father of information theory" some time before 1951.^[1] Two players take turns coloring the edges of an arbitrary graph. One player has the goal of connecting two distinguished vertices by a path of edges of their color. The other player aims to prevent this by using their color instead (or, equivalently, by erasing edges). The game is commonly played on a rectangular grid; this special case of the game was independently invented by American mathematician David Gale in the late 1950s and is known as Gale or Bridg-It.^[2]^[3]

^ Gardner, M. (1961). The Second Scientific American Book of Mathematical Puzzles and Diversions. NY: Simon and Schuster. pp. 86–87.
^ Cite error: The named reference lehman was invoked but never defined (see the help page).
^ Hayward, Ryan B.; van Rijswijck, Jack (2006). "Hex and combinatorics". Discrete Mathematics. 306 (19–20): 2515–2528. doi:10.1016/j.disc.2006.01.029. MR 2261917.

[1] Gardner, M. (1961). The Second Scientific American Book of Mathematical Puzzles and Diversions. NY: Simon and Schuster. pp. 86–87.

[lehman-2] Cite error: The named reference lehman was invoked but never defined (see the help page).

[3] Hayward, Ryan B.; van Rijswijck, Jack (2006). "Hex and combinatorics". Discrete Mathematics. 306 (19–20): 2515–2528. doi:10.1016/j.disc.2006.01.029. MR 2261917.

[1]

[2]

[3]