Some Screenshots

Here it is red's turn and he is about to make a jump. The jump is highlighted since the show-legal-moves option is turned on. The square on the white piece indicates that this is the last piece that the computer moved.

This is the search tree for one move the computer has just made. Details about the search tree can be found in the user's manual. The algorithm is minimaxing. The circle indicates which move is currently displayed on the board, and can be moved to any node the user would like to view. The highlighted paths show which move is expected from the parent node. The numbers indicate the calculated value of each node. Nodes with a + are expandable, with a - are contractable, and with an o have no children.