Hybrid Approach to Twinwidth by Taming Red (HATTER)' is a novel heuristic solver for computing the twinwidth of an undirected graph. The solver can be accessed through this link. In HATTER, we first apply a degree-1 reduction technique on the input graph. Subsequently, we decompose the reduced graph into several connected components and compute the contraction sequence for each of these components respectively. Ultimately, the resultant graph has no edges, thus we arbitrarily contract the remaining isolated vertices until the graph is reduced to a single vertex.