This thesis gives an overview of the Shannon Switching Game, Lehman’s necessary and sufficient conditions for the game to be short, cut or neutral and the corresponding strategies, and an...Show moreThis thesis gives an overview of the Shannon Switching Game, Lehman’s necessary and sufficient conditions for the game to be short, cut or neutral and the corresponding strategies, and an elaboration of Bruno and Weinberg’s application of Kishi and Kajitani’s results to finding a pair of disjoint cospanning trees in a graph if the game is short. The main contributions of this thesis are providing Lehman’s results and their proofs with graphical examples to make them easier to read, and the elaboration of Bruno and Weinberg’s algorithm mentioned above.Show less