Abstract: Parking functions are vectors that describe the parking preferences of $n$ cars that enter a one-way street containing $n$ parking spots numbered 1 through $n$. A list of each car’s preferences is compiled into vectors in which we denote as ($a_{1}, \ldots , a_{n}$), such that $a_i$ is the parking preference for car $i$. The classical parking rule allows cars to enter the street one at a time going to their preferred parking spot and parking, if that space is unoccupied. If it is occupied, they then proceed down the one-way street and park in the first available parking spot. If all cars can park, we say the vector ($a_{1}, \ldots , a_{n}$) is a parking function. In this presentation, we introduce new variants of parking function rules with backward movement called $k$-Zone, preferential, and inverse preferential functions.