Making Connections: Is There Always a Winner?
Show FileMIME type:application/pdfFile Size:272.7 Kb
MetadataShow full item record
We analyze the board game Connections™ and prove that there is always a winner. We examine the scenario in which every space on the board is covered and one specific player has not yet won. Through a series of logical arguments, we show that whenever one player has not won, there exists a path through the board making the connection needed for the other player to win.