The Middle Levels Problem has been studied since the early 1980's and is currently unsolved. The problem involves showing that the two middle levels of every Hasse diagram of odd degree contain a Hamiltonian cycle. This monograph develops techniques that utilize previously untapped symmetries to pose an algorithm that is more efficient at finding particular solutions than algorithms employed by previous authors.