-
Notifications
You must be signed in to change notification settings - Fork 0
/
checklist.txt
36 lines (31 loc) · 1.01 KB
/
checklist.txt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
TO-DO
- construct algo
- not going to remake walls; can remove code in cell (only breaking walls)
- make sure to only break wall if there is a wall there
DONE
- create cell object
- create changeWall function
- return walls in bytes
- create location variable
- make all cells and set locations for user input n
BOUNDARY RULES
if coordinate == 0, you cant move in the negative direction
if coordinate == n-1, you cant move in the positive direction
LOOP
if cell.parent == itself, you've found the loop
STEPS
1) make sure you're not breaking maze boudaries
- get a random number for coordinate and direction
- check if valid wall
2) break a valid wall
3) change wall value of that cell
4) increment +1/-1 to access cell you entered
5) change that cells wall value
6) make that cells parent = previous cell's parent
7
IMP
check if the cell is not pointing to itself
if it is, itll make a loop
to break a wall, the other cell must be pointing at itself
AND cannot be the start point (cell[0])
!!!!!! you only pop when you break !!!!!!