Mancalla 1.0
Designed and written by Josh Salisbury
Official Documentation
----------------------------
This game used matrix [B].
When started, you will be prompted as to whether or not you want to start a
new game.  If you choose 'CONTINUE', the data in [B] will be used in the
game successfully only if it has not been changed since last used.
Several variables are also used and must not be changed if you want to
continue the previous game:
A
B
T
X

This game was the first successful game I ever made using my TI-83 (after
that simplistic guessing game you all know), all in one night.
It's not too user friendly, but it does work (using one variation on the
rules or another, as if there is really an 'official' way to play).

While the game is running:
------------------------------
The numbers along the top and bottom display the number of counters in each
cell.  The numbers in the middle row label the cells, left to right, 1
through 6.  The number to the right (initially 0) is the number of counters
in player 1's bin.  The number to the left (initially 0) is the number of
counters in, you guessed it, player 2's bin.  The number in the lower right
corner displays who's turn it is currently.  Player 1 uses the row of cells
on the bottom, player 2 uses the row on top.  Enter the cell you wish to
use (player 1's cell 4 is directly below player 2's cell 4.  For each
player, the cells are numbered left to right).  All the counters from that
cell will be removed and distributed 1 at a time in all the cells counter
clock-wise from that cell, including the active player's bin and the
selected cell after one circuit has been completed.  The winner is decided
based on who has the most counters in his/her bin when the active player
has no counters to move (all his/her cells are empty).

Whew!