The WIGG programs were written by Christopher Hanusa.

WIGG.class is a compiled java program that calculates the formula in
n of the number of non-attacking configurations of a set of m chess 
pieces of the same type on a chessboard of size m x n, where one piece
is placed in each row.

The input to the program is two entries, a character representing a 
chess piece and an integer representing m.  The supported types of 
chess pieces are 
'B' : Bishop
'Q' : Queen
'K' : Knight
'N' : Nightrider 
      (a fairy chess piece which extends a knight's move indefinitely.)

An example of the command to calculate a formula for the number of 
non-attacking 3-queen configurations on a 3 x n board is
      java WIGG Q 3
(Note:  you must have java installed on your system in order to run 
this command.)