  We characterise the elements of the (maximum) idempotent generated
subsemigroup of the Kauffman monoid in terms of combinatorial data associated
to certain normal forms. We also calculate the smallest size of a generating
set and idempotent generating set.
