Re^2: compute paths in Pascal's triangle (aka Tartaglia's one)


Problems? Is your data what you think it is?
	PerlMonks

Re^2: compute paths in Pascal's triangle (aka Tartaglia's one)

by LanX (Saint)

on Mar 22, 2018 at 10:43 UTC ( [id://1211500]=note: print w/replies, xml )

Need Help??

in reply to Re: compute paths in Pascal's triangle (aka Tartaglia's one)
in thread compute paths in Pascal's triangle (aka Tartaglia's one)

an hour later oO

I don't like that there are still wrong moves possible*, probably because I din't follow my own concept...

use strict;
use warnings;
use Data::Dump qw/pp dd/;


my $goal = [3,1];
my ($nl,$nr) = @$goal;

my @results;

pathfinder( [0,0] );                      # start

pp \@$_ for @results;


sub pathfinder {
    my ( $last )=@_;

    my ($l,$r)   = @$last ;

    if ( $nl == $l ) {
        if ($nr == $r){
            push @results,[ reverse @_];
        }
        else {
            #warn "wrong",pp \@_;
            return
        }

    }


    # left
    pathfinder( [$l+1,$r  ], @_ ) if $l != $nl;

    # right
    pathfinder( [$l+1,$r+1], @_ ) if $nr != $r;
}
[download]

[[0, 0], [1, 0], [2, 0], [3, 1]]
[[0, 0], [1, 0], [2, 1], [3, 1]]
[[0, 0], [1, 1], [2, 1], [3, 1]]
[download]

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

Wikisyntax for the Monastery}

*) i.e. the else branch with the warning should never be reached.

update

solution here

Comment on Re^2: compute paths in Pascal's triangle (aka Tartaglia's one) Select or Download Code

Replies are listed 'Best First'.

Re^3: compute paths in Pascal's triangle (aka Tartaglia's one)
by hdb (Monsignor) on Mar 22, 2018 at 11:48 UTC

Well, for any given target node you build a string of the correct number of left and right moves (or zeroes and ones) and then any permutation is one of the admissible solutions (and all of them).

UPDATE: Just as illustration, using a module, and having to filter out duplicates in the permutations, it could work like this:

use strict;
use warnings;
use Algorithm::Permute;

my $node = '5-2';
my ($all, $right) = split /-/, $node;
my @path = ((0) x ($all-$right),(1) x $right);
my %pathes;
Algorithm::Permute::permute { 
    my $key = join '', @path;
    if( not exists $pathes{$key} ) {
        $pathes{$key} = 1;
        my ($l, $r) = (0,0);
        my $path = "($l-$r) ".join( " ", map{ "(".(++$l)."-".($r+=$_).
+")" } @path);
        print "$path\n";
    }
} @path;
[download]

[reply]
[d/l]

In Section Seekers of Perl Wisdom

Domain Nodelet^?

www.com | www.net | www.org

Node Status^?

node history
Node Type: note [id://1211500]
help

Chatterbox^?

How do I use this? • Last hour • Other CB clients

Other Users^?

Others admiring the Monastery: (6)

As of 2024-04-19 18:03 GMT

Sections^?

Information^?

Find Nodes^?

Leftovers^?

Today I Learned

Voting Booth^?

No recent polls found