I am more or less a novice in programming(My highest league in a multiplayer is Silver ) so please give a link if you think that this is a stupid question.
So my question is related to pathfinding algorithms, so you have a width into height map, and given a starting position on that map, you want to find the longest potential path to a given location without crossing over your previously crossed points.
What I have tried:
Using Python3, I used classes and Objects to stoe the graph and attempted to ccompute all such possible paths, but it kept getting timed out.
Is there any way that I can do it in python? I am not as familiar in any other language.