anchor.diff:  subroutine downhill
         implicit none
         integer, parameter             :: dim = 8
  -      integer :: min, max, i, minsave, maxsave, check, minval, maxval
  -      integer, dimension(dim, dim-1) :: list
  +      integer :: min, max, i, minsave, maxsave
  +      !!integer, dimension(dim, dim-1) :: list
         real*8, dimension(2, dim)      :: pos
         real*8, dimension(dim - 1)     :: value
  -      real*8  :: x, y, alpha = 1, beta = 0.5, gamma = 1.5, dist, cutoff = 0.0001
  -      real*8  :: xsave, ysave
  +      real*8  :: alpha = 1, beta = 0.5, gamma = 1.5, dist, cutoff = 0.0001
  +      real*8  :: xsave, ysave, minval, check
   
         interface
             subroutine findval(pos, value, dim)
  
positive.code:           call reflect(pos, min, dim, alpha)
            call findval(pos, value, dim)
            call minmax(value, min, max)
            call centroid(pos, min, max, dim)
  
            !! Expansion if the minimum value becomes the maximum
            if (minsave.EQ.max) then
  
negative.code:                   call minmax(value, min, max)
                end if
  
                call centroid(pos, min, dim)
  
  
            !! Contract from old position if minima value is still minima value
  