Bridg-It - Beating Shannon’s Analog Heuristic

by    Thomas Fischer

Preprint series: 09-07, Reports on Optimization

91A46 Combinatorial games
91A43 Games involving graphs

Abstract: In 1951 Shannon provided a simple analog heuristic for the connection game Bridg-It. Although this heuristic is based only on a simple network flow analysis, Shannon reported that it almost always wins against human players when having the first move. In this note, we analyse this heuristic showing examples where the heuristic fails. Furthermore, we consider the question whether the first player always wins if both players use Shannon's heuristic.

Keywords: switching game, Bridg-It, analog heuristic, Claude Shannon

Upload: 2010-06-14

Update: 2010 -06 -14

The author(s) agree, that this abstract may be stored as full text and distributed as such by abstracting services.