Abstract: Monodromy solving is the idea that for a parametrized polynomial system with a single known solution at a given parameter p, the other solutions can be found by tracking the solution along loops based at p. We extend this concept to the concept of fibre-preserving maps, and explore how adding in the option of tracking the solutions using fibre-preserving maps could help us make the algorithm faster.