 
 ;; Firstly, we can define a function that will generate a random
 ;; vector inside of lower and upper bounds that can be combined with
-;; the unrandomised position to provide a randomised path.
+;; the non-randomised position to provide a randomised path.
 
 (defn random-vector-between [lower upper]
   [(random-between lower upper)


;; I've pulled a bunch of colours that Pollock used in his seminal
;; work "Number 8" so that each flick of paint can be rendered in a
;; random colour out of this pallete

(def canvas-colour [142 141 93])



;; In order to provide an unbounded path we can use a lazy sequence.
;; This function returns a value that is somewhat akin to list that
;; never ends. Every time you try to look at the next value in the list
;; it will generate one just in time for you to see no end.

;; In this function the first value returned should always be the
;; initial starting position, each following value should be a step
;; along the path. You can see this below, it returns the position
;; argument cons'd with another iteration of random-path with the
;; position randomised.

(defn random-path [position step-vector bounds]
