Welcome to the network Ankor server. The challenge command is described here.
Other commands are
the same as for all pbmserv games.

ankor challenge [-size=n] userid1userid2

Starts a new game for two players.

The -size option sets the board size (default 6 holes per side).

Introduction

Ankor is a 3D connection game played with coloured cubes.

Rules

Two players (O and X) each have 28 cubes of their colour.

The board is a triangular grid of triangular holes (six per side), where each hole will snugly hold a cube placed corner-downward.

Start: The board is initially empty. O places a cube on the hole of their choice, then X may elect to swap colours in lieu of making the second move (swap option).

Play: Players then take turns either:
1) adding a cube of their colour to an empty board hole, or
2) moving a cube of their colour to a valid destination point.

A destination point is valid if it can be reached through a series of connected or adjacent steps through friendly pieces (two pieces are connected if they visibly share a face). The destination point need not be connected to the source point after the move.

A cube can only be moved if:
1) it has at least two exposed faces, and
2) it does not directly support more than one column.

If the cube being moved directly supports a column above it, then the cubes in that column will naturally drop down to fill the gap.

Aim: The game ends as soon as a player forms a connected path of their colour that touches at least the tip of each board side. For example, the following game has been won by X who has formed an 'x' path between all three board sides (this path only touches a tip of the left side).

Ankor is essentially Akron played with a hexagonal stacking of tilted cubes. Akron was in fact originally designed for the hexagonal grid until phase problems were discovered; the tiled cube stacking solves these problems. The Abstract Games magazine article posted on the official Akron page has more details.

It is possible for games to deadlock and not produce a winner, however this is extremely rare.

The maximum number of cubes required for a given board size is given by the tetrahedral number Tn = n (n + 1) (n + 2) / 6.

If the -win_height option may be used to test various winning conditions.
-win_height=0 specifies that the winning path must actually touch each board side (easier to deadlock).
-win_height=1 specifies that the winning path need only touch a tip of each board side.
-win_height=-1 specifies that the winning path may touch the each board side at any height, i.e. it cat touch each of the three exposed pyramidal faces formed by the board at any height.