Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Short, fast, recursive solution in Speedy category for Golden Pyramid by StefanPochmann
C=count_gold=lambda p:p[0][0]*(len(p)<2)or C(p[:-2]+([a+max(b,c)for b,a,c in zip(p[-1][1:],*p[-2:])],))
April 15, 2015
