this is not the first thread on this topic...the previous one can be found at
Solving A Maze Using C Language!!!!
i have now found a way to move around the maze but i have now come across another problem....
If i come across a grid such as 6 ( 0 1 1 0), this would mean no wall on the noth or east sides so i could go through to the next grid.
This is a problem as what if say i went north, then after a certain amount of grids i come across a dead end. I then need to go back to the grid that had the other wall missing.
I would hen have to go backwards to the grid that had the two paths to choose from. I would therefore need some sort of marker.
This is where i need the help.
could someone please help me and also answer these questions:
- if i used the & on 6 with 1 to find out if east had a wall. (seen below)
0 1 1 0
0 0 0 1
0 0 0 0 (this means east is free)
do i have to convert the number 6 into its binary form first?
thanks a lot