Algorithm Construct Graph System For Maze

1 Construct graph system for maze. The graph entities are an id for each intersection(id), the physical row(rr) and column(cc) of the
2 Intersection, membership to a connected region (state), and a link to adjacent intersections (ptr_up ptr_down ptr_left ptr_right).
3 Prior to "make_pattern" the maze has all of the walls intact andthere are row*col of unconnected states. After "make_pattern" some of the walls are broken down and there is only one connected state for the maze.
4 A broken wall (allowed passage) in some direction is signified by a negative value of the pointer in that direction. A solid wall (not allowed passage) in some direction is signified by a positive value of the pointer in that direction.
5 The pattern is created by selective random removal of vertical or horizontal walls as a function of position in the maze. Checkerboard option the most challenging. Other patterns can be added.
6 The absolute value of the pointer is the id of the intersection in that direction.
7 Show maze to the user and the position or strength of the monster depending on the level selected by the user.
8 Show the maze to the user and ask for permission to continue or to select a different maze.
9 Start playing procedure and program the position of the monster with respect to the user’s movements.
10 Evaluate the movements of the pointer or hands of the user. If the movements are invalid or incorrect the monster gets closer or stronger.
Clear the maze if the monster reaches the user owing to incorrect movements.
Repeat the Process.
Cas...