Question

Write a program that will randomly generate a square maze that has a

side-dimension between 10 to 100 cells based on a set of attributes from the

user, and then it will solve the maze problem. The maze cells are either free

(0) or have obstacles (1). Daedalus can move over the free cells but not the

cells with obstacles. The user of the program is asked to enter two attributes

for generating the maze:

1. Side-dimension of the square maze

2. The percent free cells in the maze.

*** NO STL LIBRARY*****
**** PLEASE INCLUDE / DISTINGUISH BETWEEN .h file and .cpp file *****

Answer 1

choose a point at random out in the unsolved territory and begin a random walk: when you reach the solved territory (the maze as it is already known), add those points back to the maze; when you self-intersect you should delete the random walk back to where you self-intersected. (For the very first walk, furthermore, there is only one "solved" point in the maze so you may wish to speed up maze generation by doing a different random walk that just "busts down walls" into the as-yet-unknown area; this is called Aldous-Broder and it has the opposite problem where it tries to randomly walk into unsolved space so it takes forever when the unsolved space becomes rare.) So one would start from Now, the algorithm might get a bit weird because it looks like you are using block mazes rather than conventional thin-walled mazes; every n-by-m thin-walled maze has an embedding as a block maze of size (2n+1)-by-(2m+1) simply by making (0, y) and (x, 0) all walls, every (odd, odd) point is empty space representing one of the squares of the original maze, every (even, even) point is a block, and (odd, even) and (even, odd) points are blocks if and only if there is a vertical/horizontal wall between the corresponding squares in the original maze.

following is the given the program .

 function* randomWalkPoints({ x, y }, height, width) {
      const incr = [{dx: -1, dy: 0}, {dx: 1, dy: 0}, {dx: 0, dy: -1}, {dx: 0, dy: 1}];
      while (true) {
        const { dx, dy } = incr[Math.floor(4 * Math.random())];
        const new_x = x + dx, new_y = y + dy;
        if (new_x >= 0 && new_x < width && new_y >= 0 && new_y < width) {
          x = new_x;
          y = new_y;
          yield { x, y };
        }
      }
    }

DISTINGUISH BETWEEN .h FILE AND .cpp FILE

The convention is that .h files are declarations, and .cpp files are definitions. That's why .h files are #included -- we include the declarations. The .cpp file is the compilation unit : it's the real source code file that will be compiled (in C++)..