Knowing that a class of graphs has a finite set of minimal forbidden minors is one thing, knowing what they are is another. We present an account of techniques used to find small sets of minimal forbidden minors for few classes of graphs with treewidth at most 3.