this is just this project: https://scratch.mit.edu/projects/784870454/ but with a bigger map and a timer, the point of this is to see how fast bfs pathfinding is on scratch, the result is that it is very slow... I added a method that runs the bfs algorithm in screen refresh but only 100 times before it stops running and and refreshes the screen, this method makes the project run with a higher framerate but does not speed up the pathfinding. I am working on implementing the A star algorithm. one thing to be noted is that this is a 19200 pixel map which is probably bigger than any game would need.
