Algorithms for the generation of commutative semigroups of order eight

An algorithm for the generation of semigroups of small order is given. Special attention is paid to techniques allowing efficient pruning with respect to associativity, commutativity, and isomorphism class. A progress report on the attempt to use this algorithm for enumeration of the commutative semigroups of order eight is presented.<
>