Compute the result for a game of Hex / Polygon.
The abstract boardgame known as Hex / Polygon / CON-TAC-TIX is quite simple in rules, though complex in practice. Two players place stones on a rhombus with hexagonal fields. The player to connect his/her stones to the opposite side first wins. The four sides of the rhombus are divided between the two players (i.e. one player gets assigned a side and the side directly opposite it and the other player gets assigned the two other sides).
Your goal is to build a program that given a simple representation of a board computes the winner (or lack thereof). Note that all games need not be "fair". (For example, players may have mismatched piece counts.)
The boards look like this (with spaces added for readability, which won't be in the representation passed to your code):
. O . X .
. X X O .
O O O X .
. X O X O
X O O O X
"Player O" plays from top to bottom, "Player X" plays from left to right. In
the above example O has made a connection from left to right but nobody has
won since O didn't connect top and bottom.
To run the tests, run the command dotnet test from within the exercise directory.
Initially, only the first test will be enabled. This is to encourage you to solve the exercise one step at a time.
Once you get the first test passing, remove the Skip property from the next test and work on getting that test passing.
Once none of the tests are skipped and they are all passing, you can submit your solution
using exercism submit Connect.cs
For more detailed information about the C# track, including how to get help if you're having trouble, please visit the exercism.io C# language page.