Combinatorial exploration is a relatively recent algorithmic framework for deriving combinatorial specifications, introduced by Albert, Baen, Claesson, Nadeau, Pantone, and Ulfarsson. In this talk, we will introduce the framework and explore how it can be used to derive generating functions for various classes of chord diagrams. In particular, we will examine different decomposition strategies and their implementations, drawing on the work presented in Nabergall’s 2022 thesis.