First stated in 1973, the Cycle Double Cover Conjecture states that every bridgeless graph has a collection of cycles which cover every edge exactly twice. The problem remains wide open to this day despite much work. This talk is to present my partial results on the problem, explain why the tutte polynomial is awesome, and to draw some of the beautiful proofs by picture that arose in my work.