The twisted rabbit problem was posed by John Hubbard in the 1980s. It asks: when a certain quadratic polynomial, called the Douady rabbit, is post-composed by a mapping class, to which polynomial is the resulting map equivalent? Bartholdi--Nekrashevych solved it in 2006, and later, Belk-Lanier-Margalit-Winarski solved a more generalized version. In this talk, we introduce a two-parameter family of twisting problems and describe joint work with Winarski that solves a twisting problem for the degree d rabbit polynomial.