[math-fun] A grid with MAX (dynamic programming solution?)

RCS expressed doubt WDS's dynamic programming algorithm would actually work. --WDS: oh dear. Not quite as simple as I at first thought. The algorithm makes a table of all subgraphs of the graph. (The original problem used the king-adjacency graph in a chessboard.) There are 2^V subgraphs for a V-vertex graph. Actually with fixed startpoint, you only need subgraphs including it (2^(V-1)) and if the graph has symmetries then further savings possible, and only doing connected subgraphs is another saving,... For each subgraph, original plan was to tabulate the max attainable entry in it. However, this is not good enough. Really, you'd need to tabulate much more. The whole algorithm concept seems to break, or become impractical.