|go ahead... be a heretic|
compute paths in Pascal's triangle (aka Tartaglia's one)by Discipulus (Abbot)
|on Mar 22, 2018 at 09:03 UTC||Need Help??|
Discipulus has asked for the wisdom of the Perl Monks concerning the following question:
Hello wise monks and nuns,
I want to add a 17th fun experiment to my project: infact there is a properties I have still not shown: the number in a specific tile is also the number of different shortest path from the top tile (no backwards move nor lateral ones).
I want to show (colorizing them) all distinct paths in sequence and to do it I need a serie of coordinates: given the following structure
if the user click the node 3-1 i need to have back:
I have asked in the chatterbox some days ago and oiskuu, Eily and Lanx were so kind to suggest various approach, but franckly i was not able to implement a simple way: infact not all combinations are valid: 0-0 1-0 1-1 2-1 3-1 contains the illigal lateral move 1-0 1-1
Well I can produce all combinations and then throw away solutions with too much moves.. but for sure exists a simpler perlish way.
Squeezing my brain I only ended with naive method to highlight the area of such valid tiles:
thanks in advance
There are no rules, there are no thumbs..
Reinvent the wheel, then learn The Wheel; may be one day you reinvent one of THE WHEELS.