Solving 7×7 Hex with domination, fill-in, and virtual connections

The algorithm is powerful enough to solve arbitrary 7×7 game-states. In particular, we use it to determine the outcome of a 7×7 Hex game after each of the 49 possible opening moves, in each case finding an explicit proof-tree for the winning player.