This project looks at the patrolling strategy outlined in the paper When Patrolmen Become Corrupted (Czyzowicz, et al., 2015). This patrolling strategy introduces the concept of fault tolerance, and provides an optimal strategy when some of the patrolling robots are faulty or unreliable. The goal of this project was first to create a simulation of the algorithm in Python, and then to extend the simulation to look at how the patrolling strategy performs when half or greater than half of the robots are faulty. This can be used to identify situations where either a different patrolling strategy or a modification to the suggested patrolling strategy may provide better results (by reducing the idle time, or the maximum amount of time a point on the line segment remains unvisited).