Unix source - tar file
This is the original source with minor adjustments to run under Solaris/X11.

PC source - zip file
This is a stripped down version of the Unix source below which will compile on the PCs in BE150. You can play against the computer.

PC source for project - zip file
This is an even further stripped down version which will compile on the PCs in BE150. This version is for experimenting with different strategies. Stubs are provided for communicating with the Borg board. You can write C programs for these routines to simulate your strategy. The stubs are in borgmove.c. The routine int borg_move(int white_move) is called to obtain Black's moves; it passes in White's last move. A move is encoded as an integer; -1 is a pass. The routine void init_borg() is called each time a new game is started. You should rewrite these routines to implement your strategy, but they should not share any data with the rest of the program. These routines will be replaced by ones that write and read the ports to make the program play against the Borg board.

Newer PC source for project - zip file
This version has additional features:

  -s seed
    breaks ties randomly to provide multiple games at a given difficulty
  -k 
    White's moves are entered through keyboard

Deterministic PC source for project - zip file
This version use the number of leaves examined rather than time to limit the depth of the game search tree. Includes all of the previous features.