Explanation of the grid traversal algorithm by Amanatides and Woo: http://www.cse.yorku.ca/~amana/research/grid.pdf @Lefdine requested me to make a tutorial of how my quick raycaster works: https://scratch.mit.edu/projects/455774022/ It works by keeping track of how far it has to travel to get to the next wall in both axes, and then stepping across the closer edge and incrementing it to the next wall. Key: Blue dots are the grid cells that are walked through. Red dots are horizontal steps. Green dots are vertical steps. Turn off run without refresh in the traverse block to watch the variables change. Look at the paper for more info. This project isn't a complete implementation. I removed some stuff to make the demo work better.
