Talk:Maximum triangle path sum: Difference between revisions

To find the efficiency of the REXX solution, a system of defining the lines (rows) of the triangle was chosen such that each row could be easily be generated, and more importantly, have a verifiable answer (for some even largish even number of rows).

The algorithm used was to start each row (the left end) with unity, and increase each column number by one, so that the 53^rd number on row 53 (and every other higher row) is 53.   Verifications of the maximum triangle path sum (for some triangles) iscan be easily seen by the results (below).