deletions | additions       diff --git a/Circle .tex b/Circle .tex  index cdd4dcf..02a8aa3 100644  --- a/Circle .tex  +++ b/Circle .tex 
...
Shot configurations were evaluated for $1$ shot up to $4$ shots. Beyond $4$ shots the algorithm becomes significantly  less efficient. This efficiency problem is discussed in the following section. Each shot was modeled as a random walk. Like with SAW, a this random walk is a mathematical formalization of a path that consists of a succession of random steps. In this application, however, the constraint is not that two separate steps cannot coincide; rather, two separate circles cannot coincide.