Re^4: compute paths in Pascal's triangle (aka Tartaglia's one) -- the winner is..

Other footnotes:

If speed matters: the recursive approach can be speed up by memoizing the tails of a path to the last point.
An easy iterative approach ( now Breadth-first_search) can be constructed from this code.

Cheers Rolf
_{(addicted to the Perl Programming Language and ☆☆☆☆ :)

Wikisyntax for the Monastery}

Comment on Re^4: compute paths in Pascal's triangle (aka Tartaglia's one) -- the winner is..