This is a solution to a coding problem published by Reaktor. Solution.js contains a simple solution to the problem, where as browser_demo contains another solution and runs a graphical demo inspired by Sega Out Run.
You may see the demo in action here:
http://demos.klausnygard.fi/reaktor-fast-track-pt3-solution/
Find the largest sum along the route from the top of a tree to the bottom without examining every possible path. The best path is the one with largest cumulative sum from the nodes. Example tree:
5
14 23
81 23 43
43 51 33 10
where the largest sum would cumulate by route [5,14,81,51], thus resulting in the best path.