Seek optimization algorithms, a labyrinth matrix M * N, M rows N columns, weight matrix, there are negative, the starting point in (1, 1), the end point (M, N), way of mazes can only down or to the right, to a destination for the value of the sum the sum of the weights of corresponding points on the path, to calculate the maximum of the sum algorithm, optimization, as far as possible eliminate enumeration violence such as search, hoping to get a highest efficiency of the algorithm