Ok I had to do some research on the problem. So a matrix of:

[ [0 5 6]
, [1 4 7]
, [2 3 8] ]

The longest non-self-intersecting path for this example would be of length 9 ? I wanted to make sure I understood the challenge.

Yes correct.

And for say:

Awesome

The answer would be 8.

@user21820 Oh maybe I don't understand it.. What is the exact sequence for this? I thought it was [1,2,3,5,5,5,5]

@kit That is one path, but there is a longer one.

Oh, what's that for that example?

oh, nm

=)

I see it

Okay I need to go, so it's a good time to stop. Next time I look forward to seeing your solution!

@user21820 Thank you. I'll have it done probably later today as i haven't used python much in some years. Thanks for your explanations!