  In this note we gather the theoretical outlines of three basic algorithms for
tangles in abstract separation systems: a naive tree search for finding
tangles; an algorithm which outputs a certificate for the non-existence of
tangles if possible, and otherwise a way to jump-start the naive tree search;
and a way to obtain a tree-of-tangles.
