Click the green flag in the top right corner to generate a new path. If a solution is impossible the project will stop running after 600 checks. The A* pathfinding algorithm is an algorithm that efficiently finds the shortest path between 2 points on a grid. It can navigate around obstacles. The Youtube video linked at the bottom explains how it works. My project is a recreation of that algorithm. The algorithm can work instantly, but I have added a 1/15 second delay after each check to demonstrate how it works. It creates a randomly generated grid with noise obstacles (black dots). It then places a start node (blue) and an end node (pink). The red dots represent each tile that is checked, and, once a path is found, the green dots represent the path. Grid length and grid height determine the dimensions of the grid. Density increases the volume of black dots. Instant makes it try to run instantly (which does not always work on low-end computers because Scratch is not very efficient). Youtube tutorial I used: https://scratch.mit.edu/discuss/youtube/-L-WgKMFuhE/
