![Grid Pathfinding [Recoded/Fixed] copy](https://cdn2.scratch.mit.edu/get_image/project/1085730604_480x360.png)
2 tests guys 9x9 48 solution + 20x20 random solution. Progress - Bottom Right Press D for darkmode. How is this faster? It goes onto the next starting point as soon as the longest path for the starting point is found. Will this find the longest path? As long as the board is 447x447 or less Does this have any limits? Yes, 447x447 is the biggest square board that can be run 448x448 can't run the last 704 cells, because of list limits.
