I enjoy to learn about algorithms and programming stuff. So I decided to implement something in my free time. Furthermore, this that I'm creating now is for a programming test for a job vaccancy. It's call PERFECT MAZE. A perfect maze is defined as having no loops or closed circuits, and no innacessible areas. In a perfect maze, any two points are connected through a singular, unbroken path. There are a lot of algorithms, I decided to create all of them to see the differences between them. Week 1 (01-03-2019 and 03-03-2019) For now, I'm only have the basics: you can change the width and the height of the maze and regenerate it, all the cells have their neighbours and the walls (north, south, east and west wall) and I created a function to destroy the wall. Video: Week 2 (09-03-2019 and 10-03-2019) Yes! Finally I did it the first algorithm. I did the Hunt and Kill algorithm because it is the easiest to understand. I need to solve typo error...