Recent developments in universal algebra have revealed a significant relationship between the structure of finite algebras and the constraint satisfaction problem (CSP). The main goal of the Bard College Laboratory for Algebraic and Symbolic Computation (ASC) is to classify all finite quandles through the CSP. This talk presents an overview of this research project that focuses upon how systems such as GAP, KnotPlot, Mathematica, Prover9/Mace4, and SWI-Prolog have played essential roles.