Sha256: be1992d7196253ac76867b03bcaf7e8e59f2aaf2286f9398d5c1e85535a2ff7a
Contents?: true
Size: 1016 Bytes
Versions: 156
Compression:
Stored size: 1016 Bytes
Contents
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).
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.
Version data entries
156 entries across 156 versions & 1 rubygems