Shannon switching game

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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]

Rules[edit]

Player Cut took 3 turns (dotted edges), player Short took 4 turns (green edges).

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. The game always terminates after a finite number of moves, and one of the two players has to win. Either Short, Cut, or the player moving first is guaranteed the existence of a winning strategy on any given graph.[4]

The Short and Cut games are a duality; that is, the game can be restated so that both players have the same goal: to secure a certain edge set with distinguished edge e. Short tries to secure the edge set that with e makes up a circuit, while Cut tries to secure an edge set that with e makes up a cutset, the minimal set of edges that connect two subgraphs.

Variants[edit]

Versions of the Shannon switching game played on a directed graph and an oriented matroid have been described for theoretical purposes;[5][6] but no corresponding commercial games have been published.

Gale[edit]

A win for red in Gale

In this game invented by American mathematician David Gale and described in Martin Gardner's column in Scientific American Oct. 1958, two grids of differently-colored dots are overlaid at an offset. One player links orthogonally adjacent dots on one grid, and the other player uses the other. One player attempts to link the top of their grid to the bottom, while the other tries to link their left side to the right. The game is equivalent to the Shannon switching game played on a rectangular grid. No draw can result; the first player can always win with correct play.

A commercial board game implementing the scheme was marketed in 1960 by Hassenfeld Brothers under the name Bridg-It.[7] The game consisted of a plastic board with two interleaved 5x6 rectangular grids of pedestals (one set yellow, the other red), two sets of 20 each red and yellow plastic bridges, and matching pegs to mount them on. Players alternate placing a bridge across any two adjacent pedestals of matching color until one player connects the two opposite sides of the board marked in the player's color. A variant of the game is described in the instructions: each player gets a limited number of bridges, say 10. If neither player has won when all the bridges are placed, a player in his turn, may reposition one of his bridges until a winner results. The game is long out of production.

An electronic implementation of the Game of Gale is available in the Ludii Games Portal.

Relationship to other games[edit]

The Shannon switching game can be seen as a special case of a Maker-Breaker game, in which the winning patterns for the Maker are connecting paths.

A weakly-related connection game Hex is played on a grid of hexagons, and has 6-connectivity. Generalized Hex is played on a graph, just like the Shannon game, but instead of coloring the edges, in Hex the players color the vertices. These games have completely different structure and properties.

Another connectivity game played with paper and pencil on a rectangular array of dots (or graph paper) is the children's game of "dots and boxes". Players alternate drawing in a vertical or horizontal line connecting any two adjacent dots. When a line completes a square, the player initials the square. After all the lines have been filled in, the player who has taken the most squares is the winner.

An extension of Gale, called Qua, is played by three players on a 3D game board cube composed of a grid of N3 cells. N is an odd number equal to the number of cells along the edges of the game board cube. The initial Qua Cube game board layout and rules are described at its Board Game Geek entry.[8]

Computational complexity[edit]

An explicit solution for the undirected switching game was found in 1964 for any such game using matroid theory. Short should aim for a position in which there exist two disjoint subsets of the remaining unchosen edges such that either of the two subsets would connect the two distinguished vertices. If Short can make a move that results in a position with this property, then Short can win regardless of what the other player does; otherwise, Cut can win.[2]

Unlike some other connection games, which can be PSPACE hard,[9][10] optimal moves for the undirected switching game can be found in polynomial time per move. After removing from the graph the edges chosen by Cut, and contracting the edges chosen by Short, the resulting graph is a minor of the starting graph. The problem of testing for the existence of two disjoint trees, each connecting the distinguished vertices, can be represented as a matroid partitioning problem, which can be solved in polynomial time. Alternatively, it is possible to solve the same problem using network flow algorithms.

See also[edit]

  • TwixT, a different and harder connection game on the square grid

References[edit]

  1. ^ Gardner, M. (1961). The Second Scientific American Book of Mathematical Puzzles and Diversions. NY: Simon and Schuster. pp. 86–87.
  2. ^ a b Lehman, Alfred (1964). "A solution of the Shannon switching game". Journal of the Society for Industrial and Applied Mathematics. 12 (4): 687–725. doi:10.1137/0112059. JSTOR 2946344. MR 0173250.
  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.
  4. ^ Stephen M. Chase (1972). "An implemented graph algorithm for winning Shannon Switching Games". Communications of the ACM. 15 (4): 253–256. doi:10.1145/361284.361293. S2CID 21110956.
  5. ^ Hamidoune, Yahya Ould; Las Vergnas, Michel (1986). "Directed switching on graphs and matroids". Journal of Combinatorial Theory. Series B. 40 (3): 237–239. doi:10.1016/0095-8956(86)90083-3.
  6. ^ Cláudio, A. P.; Fonseca, S.; Sequeira, L.; Silva, I. P. (2015). "Shannon switching game and directed variants". In Bourguignon, J.-P.; Jeltsch, R.; Pinto, A.A.; Viana, M. (eds.). Dynamic, Games and Science: International Conference and Advanced School Planet Earth, DGS II, Portugal, August 28–September 6, 2013. CIM Series in Mathematical Sciences. Springer. pp. 187–199. doi:10.1007/978-3-319-16118-1_10. ISBN 978-3-319-16117-4.
  7. ^ Bridg-it at BoardGameGeek
  8. ^ "Qua". BoardGameGeek. Retrieved 2020-08-28.
  9. ^ Even, S. (October 1976). "A Combinatorial Problem Which is Complete in Polynomial Space". Journal of the ACM. 23 (4): 710–719. doi:10.1145/321978.321989. S2CID 8845949.
  10. ^ Reisch, Stefan (1981). "Hex ist PSPACE-vollständig". Acta Informatica. 15 (2): 167–191. doi:10.1007/BF00288964. MR 0599616. S2CID 9125259.

External links[edit]

  • Graph Game, a Java implementation of the Shannon switching game