Recursive Backtracking Algorithm Basic Idea This is a simple depth-first search Algorithm, which can generate mazes by carving walls between adjacent cells randomly, and Backtracking when it reaches a dead end. Making the grid The grid was the easiest part, a 1D list that contained a Cell object grid = [] for i in...

MicroMouse Context So I saw this awesome video on Veritasium’s channel today and was totally fascinated by the different techniques used by the MicroMouse competition winners to make you solve this simple yet awesome problem. It got me thinking, can I implement this game in a language I’m not that good in, c++?. The...