Using the A* Algorithm (A-Star), this program can correctly navigate through a maze of squares while going across the squares that total the least score. The scores designated to each tile can go up to 10, but using the Max Weight slider you can change how high the scores go up to. The darker a square is, the higher its score is. The grid height and width sliders determine the size of the grid. Time Taken represents the time it took your computer to figure out the best route. Try to figure it out before the computer does! Have fun :) No stop!! Danger: Do not pass this line _______________________ GO BACK Ok fine Go on. If you got here comment "Maze Complete" and leave a heart and star :)
This is a remix of @tacotuesdayx's Maze Pathfinder with the one modification, requested by @dhaxton, that the min weight is zero instead of 0. I updated the lower bound heuristic to be zero instead of the distance to the target.
