Our goal is to be able to determine the distance between two partitions in the same Rouquier block. This paper explores a lower bound on the number of steps required to get from the quotient of a partition lambda; to (empty set, empty set, ..., (w)). We will use the Young diagrams in the quotient of lambda and a process of right and left steps to obtain a new partition that is connected to lambda in the Brauer graph of these representations. Paired with this process we will incorporate a notation called the badness of each box in the Young diagram representation of the quotient of lambda;. This will allow us to show that the lower bound on the number of steps is less than or equal to the initial badness, b, of the starting partition divided by the maximum reduction of badness by each right and left step, 2w.

2.