Sha256: 36ec20ec6f9757cb6eedffd8ee1bfea3b2608282ef99a5f90b208aabf0dabcf7
Contents?: true
Size: 1.28 KB
Versions: 183
Compression:
Stored size: 1.28 KB
Contents
# Connect
Compute the result for a game of Hex / Polygon.
The abstract boardgame known as
[Hex](https://en.wikipedia.org/wiki/Hex_%28board_game%29) / 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.
## Submitting Incomplete Solutions
It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
183 entries across 183 versions & 1 rubygems