anchor.diff:        do while (dist > cutoff)
         !do while (i < 10)
             !! Reflection first
  -          write(*,*) i
  +          !write(*,*) i
             minsave = min
  +          minval = value(min)
             xsave = pos(1, min)
             ysave = pos(2, min)
             call reflect(pos, min, dim, alpha)
  
positive.code: 
            !! Expansion if the minimum value becomes the maximum
            if (minsave.EQ.max) then
                write(*,*) "expanding...", dist
               
                maxsave = max
                xsave = pos(1, max)
  
negative.code:       integer                :: i
  
        do i = 1, dim - 1
            value(i) = -sqrt((pos(1,i) - sourcex) * (pos(1,i) - sourcex) &
                       + (pos(2,i) - sourcey) * (pos(2,i) - sourcey))
        end do
  
  