Hex

Last week, when we were discussing Nash and his studies during my economy class, my teacher demonstrated a game Nash claimed to have a winning strategy for. It's called Hex and reminds me a bit of the Japanese game known over the world as Go (which is a million gazillion times harder). The board consists of 49 (7x7) to 121 (11x11) adjecent hexagons.

The game requires two players (black and white) with one winning condition, which is to
have a chain from one end of the board to the other (left to right for black, top to bottom for white) uninturrupted by the other player. The players get to place one stone
per turn.
So... why did I explain all this? Well... because when I played it myself I didn't manage to win a single time (even at the easiest setting). But maybe one of you can. Try it here. Whoever manages to win earns my utmost respect.

Good luck