URL https://opencores.org/ocsvn/or1k_old/or1k_old/trunk
Subversion Repositories or1k_old

[/] [or1k_old/] [trunk/] [mw/] [src/] [demos/] [nanox/] [maze.c] - Blame information for rev 1782

Details | Compare with Previous | View Log

/******************************************************************************
 * [ maze ] ...
 *
 * modified:  [ 1-04-00 ]  Johannes Keukelaar <johannes@nada.kth.se>
 *              Added -ignorant option (not the default) to remove knowlege
 *              of the direction in which the exit lies.
 *
 * modified:  [ 6-28-98 ]  Zack Weinberg <zack@rabi.phys.columbia.edu>
 *
 *              Made the maze-solver somewhat more intelligent.  There are
 *              three optimizations:
 *
 *              - Straight-line lookahead: the solver does not enter dead-end
 *                corridors.  This is a win with all maze generators.
 *
 *              - First order direction choice: the solver knows where the
 *                exit is in relation to itself, and will try paths leading in
 *                that direction first. This is a major win on maze generator 1
 *                which tends to offer direct routes to the exit.
 *
 *              - Dead region elimination: the solver already has a map of
 *                all squares visited.  Whenever it starts to backtrack, it
 *                consults this map and marks off all squares that cannot be
 *                reached from the exit without crossing a square already
 *                visited.  Those squares can never contribute to the path to
 *                the exit, so it doesn't bother checking them.  This helps a
 *                lot with maze generator 2 and somewhat less with generator 1.
 *
 *              Further improvements would require knowledge of the wall map
 *              as well as the position of the exit and the squares visited.
 *              I would consider that to be cheating.  Generator 0 makes
 *              mazes which are remarkably difficult to solve mechanically --
 *              even with these optimizations the solver generally must visit
 *              at least two-thirds of the squares.  This is partially
 *              because generator 0's mazes have longer paths to the exit.
 *
 * modified:  [ 4-10-97 ]  Johannes Keukelaar <johannes@nada.kth.se>
 *              Added multiple maze creators. Robustified solver.
 *              Added bridge option.
 * modified:  [ 8-11-95 ] Ed James <james@mml.mmc.com>
 *              added fill of dead-end box to solve_maze while loop.
 * modified:  [ 3-7-93 ]  Jamie Zawinski <jwz@jwz.org>
 *              added the XRoger logo, cleaned up resources, made
 *              grid size a parameter.
 * modified:  [ 3-3-93 ]  Jim Randell <jmr@mddjmr.fc.hp.com>
 *              Added the colour stuff and integrated it with jwz's
 *              screenhack stuff.  There's still some work that could
 *              be done on this, particularly allowing a resource to
 *              specify how big the squares are.
 * modified:  [ 10-4-88 ]  Richard Hess    ...!uunet!cimshop!rhess
 *              [ Revised primary execution loop within main()...
 *              [ Extended X event handler, check_events()...
 * modified:  [ 1-29-88 ]  Dave Lemke      lemke@sun.com
 *              [ Hacked for X11...
 *              [  Note the word "hacked" -- this is extremely ugly, but at
 *              [   least it does the job.  NOT a good programming example
 *              [   for X.
 * original:  [ 6/21/85 ]  Martin Weiss    Sun Microsystems  [ SunView ]
 *
 ******************************************************************************
 Copyright 1988 by Sun Microsystems, Inc. Mountain View, CA.
 
 All Rights Reserved
 
 Permission to use, copy, modify, and distribute this software and its
 documentation for any purpose and without fee is hereby granted,
 provided that the above copyright notice appear in all copies and that
 both that copyright notice and this permission notice appear in
 supporting documentation, and that the names of Sun or MIT not be
 used in advertising or publicity pertaining to distribution of the
 software without specific prior written permission. Sun and M.I.T.
 make no representations about the suitability of this software for
 any purpose. It is provided "as is" without any express or implied warranty.
 
 SUN DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE, INCLUDING
 ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
 PURPOSE. IN NO EVENT SHALL SUN BE LIABLE FOR ANY SPECIAL, INDIRECT
 OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS
 OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
 OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE
 OR PERFORMANCE OF THIS SOFTWARE.
 *****************************************************************************/
 
static int solve_delay, pre_solve_delay, post_solve_delay;
 
#include <stdio.h>
#include <stdlib.h>
//#include <unistd.h>
#define usleep(x)
#include <math.h>
#define MWINCLUDECOLORS
#include "nano-X.h"
#include "maze.h"
 
#define MAX_MAZE_SIZE_X 100
#define MAX_MAZE_SIZE_Y 100
 
#define MOVE_LIST_SIZE  (MAX_MAZE_SIZE_X * MAX_MAZE_SIZE_Y)
 
#define NOT_DEAD        0x8000
#define SOLVER_VISIT    0x4000
#define START_SQUARE    0x2000
#define END_SQUARE      0x1000
 
#define WALL_TOP        0x8
#define WALL_RIGHT      0x4
#define WALL_BOTTOM     0x2
#define WALL_LEFT       0x1
#define WALL_ANY        0xF
 
#define DOOR_IN_TOP     0x800
#define DOOR_IN_RIGHT   0x400
#define DOOR_IN_BOTTOM  0x200
#define DOOR_IN_LEFT    0x100
#define DOOR_IN_ANY     0xF00
 
#define DOOR_OUT_TOP    0x80
#define DOOR_OUT_RIGHT  0x40
#define DOOR_OUT_BOTTOM 0x20
#define DOOR_OUT_LEFT   0x10
 
 
#define border_x        (0)
#define border_y        (0)
 
#define get_random(x)   (random() % (x))
 
static unsigned short maze[MAX_MAZE_SIZE_X][MAX_MAZE_SIZE_Y];
 
static struct {
  unsigned char x;
  unsigned char y;
  unsigned char dir, ways;
} move_list[MOVE_LIST_SIZE], save_path[MOVE_LIST_SIZE], path[MOVE_LIST_SIZE];
 
static int maze_size_x, maze_size_y;
static int sqnum, cur_sq_x, cur_sq_y, path_length;
static int start_x, start_y, start_dir, end_x, end_y, end_dir;
static int grid_width, grid_height;
static int bw;
 
static int      x = 0, y = 0, restart = 0, stop = 0, state = 1, max_length;
static int      sync_p, bridge_p, ignorant_p;
 
static GR_GC_ID gc, cgc, tgc, sgc, ugc;
GR_GC_ID erase_gc;
 
static void
set_maze_sizes (int width, int height)
{
  maze_size_x = width / grid_width;
  maze_size_y = height / grid_height;
}
 
static void
initialize_maze (void) /* draw the surrounding wall and start/end squares */
{
  register int i, j, wall;
 
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  /* initialize all squares */
  for ( i=0; i<maze_size_x; i++) {
    for ( j=0; j<maze_size_y; j++) {
      maze[i][j] = 0;
    }
  }
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
 
  /* top wall */
  for ( i=0; i<maze_size_x; i++ ) {
    maze[i][0] |= WALL_TOP;
  }
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
 
  /* right wall */
  for ( j=0; j<maze_size_y; j++ ) {
    maze[maze_size_x-1][j] |= WALL_RIGHT;
  }
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
 
  /* bottom wall */
  for ( i=0; i<maze_size_x; i++ ) {
    maze[i][maze_size_y-1] |= WALL_BOTTOM;
  }
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
 
  /* left wall */
  for ( j=0; j<maze_size_y; j++ ) {
    maze[0][j] |= WALL_LEFT;
  }
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
 
  /* set start square */
  wall = get_random(4);
  switch (wall) {
  case 0:
    i = get_random(maze_size_x);
    j = 0;
    break;
  case 1:
    i = maze_size_x - 1;
    j = get_random(maze_size_y);
    break;
  case 2:
    i = get_random(maze_size_x);
    j = maze_size_y - 1;
    break;
  case 3:
    i = 0;
    j = get_random(maze_size_y);
    break;
  }
  maze[i][j] |= START_SQUARE;
  maze[i][j] |= ( DOOR_IN_TOP >> wall );
  maze[i][j] &= ~( WALL_TOP >> wall );
  cur_sq_x = i;
  cur_sq_y = j;
  start_x = i;
  start_y = j;
  start_dir = wall;
  sqnum = 0;
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
 
  /* set end square */
  wall = (wall + 2)%4;
  switch (wall) {
  case 0:
    i = get_random(maze_size_x);
    j = 0;
    break;
  case 1:
    i = maze_size_x - 1;
    j = get_random(maze_size_y);
    break;
  case 2:
    i = get_random(maze_size_x);
    j = maze_size_y - 1;
    break;
  case 3:
    i = 0;
    j = get_random(maze_size_y);
    break;
  }
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  maze[i][j] |= END_SQUARE;
  maze[i][j] |= ( DOOR_OUT_TOP >> wall );
  maze[i][j] &= ~( WALL_TOP >> wall );
  end_x = i;
  end_y = j;
  end_dir = wall;
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
}
 
static int choose_door (void);
static int backup (void);
static void draw_wall (int, int, int, GR_GC_ID);
static void draw_solid_square (int, int, int, GR_GC_ID);
static void build_wall (int, int, int);
 
static void join_sets(int, int);
 
/* For set_create_maze. */
/* The sets that our squares are in. */
static int *sets = 0;
/* The `list' of hedges. */
static int *hedges = 0;
 
/* Initialise the sets. */
static void
init_sets(void)
{
  int i, t, r;
 
  if(sets)
    free(sets);
  sets = (int *)malloc(maze_size_x*maze_size_y*sizeof(int));
  if(!sets)
    abort();
  for(i = 0; i < maze_size_x*maze_size_y; i++)
    {
      sets[i] = i;
    }
 
  if(hedges)
    free(hedges);
  hedges = (int *)malloc(maze_size_x*maze_size_y*2*sizeof(int));
  if(!hedges)
    abort();
  for(i = 0; i < maze_size_x*maze_size_y*2; i++)
    {
      hedges[i] = i;
    }
  /* Mask out outside walls. */
  for(i = 0; i < maze_size_y; i++)
    {
      hedges[2*((maze_size_x)*i+maze_size_x-1)+1] = -1;
    }
  for(i = 0; i < maze_size_x; i++)
    {
      hedges[2*((maze_size_y-1)*maze_size_x+i)] = -1;
    }
 
  for(i = 0; i < maze_size_x*maze_size_y*2; i++)
    {
      t = hedges[i];
      r = random()%(maze_size_x*maze_size_y*2);
      hedges[i] = hedges[r];
      hedges[r] = t;
    }
}
 
/* Get the representative of a set. */
static int
get_set(int num)
{
  int s;
 
  if(sets[num]==num)
    return num;
  else
    {
      s = get_set(sets[num]);
      sets[num] = s;
      return s;
    }
}
 
/* Join two sets together. */
static void
join_sets(num1, num2)
     int num1, num2;
{
  int s1, s2;
 
  s1 = get_set(num1);
  s2 = get_set(num2);
 
  if(s1<s2)
    sets[s2] = s1;
  else
    sets[s1] = s2;
}
 
/* Exitialise the sets. */
static void
exit_sets(void)
{
  if(hedges)
    free(hedges);
  hedges = 0;
  if(sets)
    free(sets);
  sets = 0;
}
 
/* Second alternative maze creator: Put each square in the maze in a
 * separate set. Also, make a list of all the hedges. Randomize that list.
 * Walk through the list. If, for a certain hedge, the two squares on both
 * sides of it are in different sets, union the sets and remove the hedge.
 * Continue until all hedges have been processed or only one set remains.
 */
static void
set_create_maze(void)
{
  int i, h, x, y, dir, v, w;
 
  /* Do almost all the setup. */
  init_sets();
 
  /* Start running through the hedges. */
  for(i = 0; i < 2*maze_size_x*maze_size_y; i++)
    {
      h = hedges[i];
 
      /* This one is in the logo or outside border. */
      if(h==-1)
        continue;
 
      dir = h%2?1:2;
      x = (h>>1)%maze_size_x;
      y = (h>>1)/maze_size_x;
 
      v = x;
      w = y;
      switch(dir)
        {
        case 1:
          v++;
          break;
        case 2:
          w++;
          break;
        }
 
      if(get_set(x+y*maze_size_x)!=get_set(v+w*maze_size_x))
        {
          join_sets(x+y*maze_size_x, v+w*maze_size_x);
          /* Don't draw the wall. */
        }
      else
        {
          /* Don't join the sets. */
          build_wall(x, y, dir);
        }
    }
 
  /* Free some memory. */
  exit_sets();
}
 
/* First alternative maze creator: Pick a random, empty corner in the maze.
 * Pick a random direction. Draw a wall in that direction, from that corner
 * until we hit a wall. Option: Only draw the wall if it's going to be
 * shorter than a certain length. Otherwise we get lots of long walls.
 */
static void
alt_create_maze(void)
{
  char *corners;
  int *c_idx;
  int i, j, height, width, open_corners, k, dir, x, y;
 
  height = maze_size_y+1;
  width = maze_size_x+1;
 
  /* Allocate and clear some mem. */
  corners = (char *)calloc(height*width, 1);
  if(!corners)
    return;
 
  /* Set up the indexing array. */
  c_idx = (int *)malloc(sizeof(int)*height*width);
  if(!c_idx)
    {
      free(corners);
      return;
    }
  for(i = 0; i < height*width; i++)
    c_idx[i] = i;
  for(i = 0; i < height*width; i++)
    {
      j = c_idx[i];
      k = random()%(height*width);
      c_idx[i] = c_idx[k];
      c_idx[k] = j;
    }
 
  /* Set up some initial walls. */
  /* Outside walls. */
  for(i = 0; i < width; i++)
    {
      corners[i] = 1;
      corners[i+width*(height-1)] = 1;
    }
  for(i = 0; i < height; i++)
    {
      corners[i*width] = 1;
      corners[i*width+width-1] = 1;
    }
 
  /* Count open gridpoints. */
  open_corners = 0;
  for(i = 0; i < width; i++)
    for(j = 0; j < height; j++)
      if(!corners[i+width*j])
        open_corners++;
 
  /* Now do actual maze generation. */
  while(open_corners>0)
    {
      for(i = 0; i < width*height; i++)
        {
          if(!corners[c_idx[i]])
            {
              x = c_idx[i]%width;
              y = c_idx[i]/width;
              /* Choose a random direction. */
              dir = random()%4;
 
              k = 0;
              /* Measure the length of the wall we'd draw. */
              while(!corners[x+width*y])
                {
                  k++;
                  switch(dir)
                    {
                    case 0:
                      y--;
                      break;
                    case 1:
                      x++;
                      break;
                    case 2:
                      y++;
                      break;
                    case 3:
                      x--;
                      break;
                    }
                }
 
              if(k<=max_length)
                {
                  x = c_idx[i]%width;
                  y = c_idx[i]/width;
 
                  /* Draw a wall until we hit something. */
                  while(!corners[x+width*y])
                    {
                      open_corners--;
                      corners[x+width*y] = 1;
                      switch(dir)
                        {
                        case 0:
                          build_wall(x-1, y-1, 1);
                          y--;
                          break;
                        case 1:
                          build_wall(x, y, 0);
                          x++;
                          break;
                        case 2:
                          build_wall(x, y, 3);
                          y++;
                          break;
                        case 3:
                          build_wall(x-1, y-1, 2);
                          x--;
                          break;
                        }
                    }
                }
            }
        }
    }
 
  /* Free some memory we used. */
  free(corners);
  free(c_idx);
}
 
/* The original maze creator. Start somewhere. Take a step in a random
 * direction. Keep doing this until we hit a wall. Then, backtrack until
 * we find a point where we can go in another direction.
 */
static void
create_maze (void)    /* create a maze layout given the initialized maze */
{
  register int i, newdoor = 0;
 
  do {
    move_list[sqnum].x = cur_sq_x;
    move_list[sqnum].y = cur_sq_y;
    move_list[sqnum].dir = newdoor;
    while ( ( newdoor = choose_door() ) == -1 ) { /* pick a door */
      if ( backup() == -1 ) { /* no more doors ... backup */
        return; /* done ... return */
      }
    }
 
    /* mark the out door */
    maze[cur_sq_x][cur_sq_y] |= ( DOOR_OUT_TOP >> newdoor );
 
    switch (newdoor) {
    case 0: cur_sq_y--;
      break;
    case 1: cur_sq_x++;
      break;
    case 2: cur_sq_y++;
      break;
    case 3: cur_sq_x--;
      break;
    }
    sqnum++;
 
    /* mark the in door */
    maze[cur_sq_x][cur_sq_y] |= ( DOOR_IN_TOP >> ((newdoor+2)%4) );
 
    /* if end square set path length and save path */
    if ( maze[cur_sq_x][cur_sq_y] & END_SQUARE ) {
      path_length = sqnum;
      for ( i=0; i<path_length; i++) {
        save_path[i].x = move_list[i].x;
        save_path[i].y = move_list[i].y;
        save_path[i].dir = move_list[i].dir;
      }
    }
 
  } while (1);
 
}
 
 
static int
choose_door (void)                                   /* pick a new path */
{
  int candidates[3];
  register int num_candidates;
 
  num_candidates = 0;
 
  /* top wall */
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_IN_TOP )
    goto rightwall;
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_OUT_TOP )
    goto rightwall;
  if ( maze[cur_sq_x][cur_sq_y] & WALL_TOP )
    goto rightwall;
  if ( maze[cur_sq_x][cur_sq_y - 1] & DOOR_IN_ANY ) {
    maze[cur_sq_x][cur_sq_y] |= WALL_TOP;
    maze[cur_sq_x][cur_sq_y - 1] |= WALL_BOTTOM;
    draw_wall(cur_sq_x, cur_sq_y, 0, gc);
    goto rightwall;
  }
  candidates[num_candidates++] = 0;
 
 rightwall:
  /* right wall */
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_IN_RIGHT )
    goto bottomwall;
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_OUT_RIGHT )
    goto bottomwall;
  if ( maze[cur_sq_x][cur_sq_y] & WALL_RIGHT )
    goto bottomwall;
  if ( maze[cur_sq_x + 1][cur_sq_y] & DOOR_IN_ANY ) {
    maze[cur_sq_x][cur_sq_y] |= WALL_RIGHT;
    maze[cur_sq_x + 1][cur_sq_y] |= WALL_LEFT;
    draw_wall(cur_sq_x, cur_sq_y, 1, gc);
    goto bottomwall;
  }
  candidates[num_candidates++] = 1;
 
 bottomwall:
  /* bottom wall */
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_IN_BOTTOM )
    goto leftwall;
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_OUT_BOTTOM )
    goto leftwall;
  if ( maze[cur_sq_x][cur_sq_y] & WALL_BOTTOM )
    goto leftwall;
  if ( maze[cur_sq_x][cur_sq_y + 1] & DOOR_IN_ANY ) {
    maze[cur_sq_x][cur_sq_y] |= WALL_BOTTOM;
    maze[cur_sq_x][cur_sq_y + 1] |= WALL_TOP;
    draw_wall(cur_sq_x, cur_sq_y, 2, gc);
    goto leftwall;
  }
  candidates[num_candidates++] = 2;
 
 leftwall:
  /* left wall */
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_IN_LEFT )
    goto donewall;
  if ( maze[cur_sq_x][cur_sq_y] & DOOR_OUT_LEFT )
    goto donewall;
  if ( maze[cur_sq_x][cur_sq_y] & WALL_LEFT )
    goto donewall;
  if ( maze[cur_sq_x - 1][cur_sq_y] & DOOR_IN_ANY ) {
    maze[cur_sq_x][cur_sq_y] |= WALL_LEFT;
    maze[cur_sq_x - 1][cur_sq_y] |= WALL_RIGHT;
    draw_wall(cur_sq_x, cur_sq_y, 3, gc);
    goto donewall;
  }
  candidates[num_candidates++] = 3;
 
 donewall:
  if (num_candidates == 0)
    return ( -1 );
  if (num_candidates == 1)
    return ( candidates[0] );
  return ( candidates[ get_random(num_candidates) ] );
 
}
 
 
static int
backup (void)                                          /* back up a move */
{
  sqnum--;
  cur_sq_x = move_list[sqnum].x;
  cur_sq_y = move_list[sqnum].y;
  return ( sqnum );
}
 
 
static void
draw_maze_border (void)                         /* draw the maze outline */
{
  register int i, j;
 
 
  for ( i=0; i<maze_size_x; i++) {
    if ( maze[i][0] & WALL_TOP ) {
      GrLine(wid, gc,
                border_x + grid_width * i,
                border_y,
                border_x + grid_width * (i+1) - 1,
                border_y);
    }
    if ((maze[i][maze_size_y - 1] & WALL_BOTTOM)) {
      GrLine(wid, gc,
                border_x + grid_width * i,
                border_y + grid_height * (maze_size_y) - 1,
                border_x + grid_width * (i+1) - 1,
                border_y + grid_height * (maze_size_y) - 1);
    }
  }
  for ( j=0; j<maze_size_y; j++) {
    if ( maze[maze_size_x - 1][j] & WALL_RIGHT ) {
      GrLine(wid, gc,
                border_x + grid_width * maze_size_x - 1,
                border_y + grid_height * j,
                border_x + grid_width * maze_size_x - 1,
                border_y + grid_height * (j+1) - 1);
    }
    if ( maze[0][j] & WALL_LEFT ) {
      GrLine(wid, gc,
                border_x,
                border_y + grid_height * j,
                border_x,
                border_y + grid_height * (j+1) - 1);
    }
  }
 
  draw_solid_square (start_x, start_y, WALL_TOP >> start_dir, tgc);
  draw_solid_square (end_x, end_y, WALL_TOP >> end_dir, tgc);
}
 
 
static void
draw_wall(int i, int j, int dir, GR_GC_ID gc)                /* draw a single wall */
{
  switch (dir) {
  case 0:
    GrLine(wid, gc,
              border_x + grid_width * i,
              border_y + grid_height * j,
              border_x + grid_width * (i+1),
              border_y + grid_height * j);
    break;
  case 1:
    GrLine(wid, gc,
              border_x + grid_width * (i+1),
              border_y + grid_height * j,
              border_x + grid_width * (i+1),
              border_y + grid_height * (j+1));
    break;
  case 2:
    GrLine(wid, gc,
              border_x + grid_width * i,
              border_y + grid_height * (j+1),
              border_x + grid_width * (i+1),
              border_y + grid_height * (j+1));
    break;
  case 3:
    GrLine(wid, gc,
              border_x + grid_width * i,
              border_y + grid_height * j,
              border_x + grid_width * i,
              border_y + grid_height * (j+1));
    break;
  }
  if(sync_p)
    wait_sync ();
}
 
/* Actually build a wall. */
static void
build_wall(i, j, dir)
     int i, j, dir;
{
  /* Draw it on the screen. */
  draw_wall(i, j, dir, gc);
  /* Put it in the maze. */
  switch(dir)
    {
    case 0:
      maze[i][j] |= WALL_TOP;
      if(j>0)
        maze[i][j-1] |= WALL_BOTTOM;
      break;
    case 1:
      maze[i][j] |= WALL_RIGHT;
      if(i<maze_size_x-1)
        maze[i+1][j] |= WALL_LEFT;
      break;
    case 2:
      maze[i][j] |= WALL_BOTTOM;
      if(j<maze_size_y-1)
        maze[i][j+1] |= WALL_TOP;
      break;
    case 3:
      maze[i][j] |= WALL_LEFT;
      if(i>0)
        maze[i-1][j] |= WALL_RIGHT;
      break;
    }
}
 
static void
draw_solid_square(int i, int j,          /* draw a solid square in a square */
                  int dir, GR_GC_ID gc)
{
  switch (dir) {
  case WALL_TOP:
      GrFillRect(wid, gc,
                     border_x + bw + grid_width * i,
                     border_y - bw + grid_height * j,
                     grid_width - (bw+bw), grid_height);
      break;
  case WALL_RIGHT:
      GrFillRect(wid, gc,
                     border_x + bw + grid_width * i,
                     border_y + bw + grid_height * j,
                     grid_width, grid_height - (bw+bw));
      break;
  case WALL_BOTTOM:
      GrFillRect(wid, gc,
                     border_x + bw + grid_width * i,
                     border_y + bw + grid_height * j,
                     grid_width - (bw+bw), grid_height);
      break;
  case WALL_LEFT:
      GrFillRect(wid, gc,
                     border_x - bw + grid_width * i,
                     border_y + bw + grid_height * j,
                     grid_width, grid_height - (bw+bw));
      break;
  }
  wait_sync ();
}
 
int
longdeadend_p(int x1, int y1, int x2, int y2, int endwall)
{
    int dx = x2 - x1, dy = y2 - y1;
    int sidewalls;
 
    sidewalls = endwall | (endwall >> 2 | endwall << 2);
    sidewalls = ~sidewalls & WALL_ANY;
 
    while((maze[x2][y2] & WALL_ANY) == sidewalls)
    {
        x2 += dx;
        y2 += dy;
    }
 
    if((maze[x2][y2] & WALL_ANY) == (sidewalls | endwall))
    {
        endwall = (endwall >> 2 | endwall << 2) & WALL_ANY;
        while(x1 != x2 || y1 != y2)
        {
            x1 += dx;
            y1 += dy;
            draw_solid_square(x1, y1, endwall, sgc);
            maze[x1][y1] |= SOLVER_VISIT;
        }
        return 1;
    }
    else
        return 0;
}
 
/* Find all dead regions -- areas from which the goal cannot be reached --
   and mark them visited. */
void
find_dead_regions(void)
{
    int x, y, flipped;
 
    /* Find all not SOLVER_VISIT squares bordering NOT_DEAD squares
       and mark them NOT_DEAD also.  Repeat until no more such squares. */
    maze[start_x][start_y] |= NOT_DEAD;
 
    do
    {
        flipped = 0;
        for(x = 0; x < maze_size_x; x++)
            for(y = 0; y < maze_size_y; y++)
                if(!(maze[x][y] & (SOLVER_VISIT | NOT_DEAD))
                   && (   (x && (maze[x-1][y] & NOT_DEAD))
                       || (y && (maze[x][y-1] & NOT_DEAD))))
                {
                    flipped = 1;
                    maze[x][y] |= NOT_DEAD;
                }
        for(x = maze_size_x-1; x >= 0; x--)
            for(y = maze_size_y-1; y >= 0; y--)
                if(!(maze[x][y] & (SOLVER_VISIT | NOT_DEAD))
                   && (   (x != maze_size_x-1 && (maze[x+1][y] & NOT_DEAD))
                       || (y != maze_size_y-1 && (maze[x][y+1] & NOT_DEAD))))
                {
                    flipped = 1;
                    maze[x][y] |= NOT_DEAD;
                }
    }
    while(flipped);
 
    for (y = 0; y < maze_size_y; y++)
      for (x = 0; x < maze_size_x; x++)
      {
        if (maze[x][y] & NOT_DEAD)
          maze[x][y] &= ~NOT_DEAD;
        else if (!(maze[x][y] & SOLVER_VISIT))
        {
          maze[x][y] |= SOLVER_VISIT;
          {
            if (!maze[x][y] & WALL_ANY)
              GrFillRect(wid, ugc,
                             border_x + bw + grid_width * x,
                             border_y + bw + grid_height * y,
                             grid_width - (bw+bw), grid_height - (bw+bw));
            else
            {
              if (! (maze[x][y] & WALL_LEFT))
                draw_solid_square(x, y, WALL_LEFT, ugc);
              if (! (maze[x][y] & WALL_RIGHT))
                draw_solid_square(x, y, WALL_RIGHT, ugc);
              if (! (maze[x][y] & WALL_TOP))
                draw_solid_square(x, y, WALL_TOP, ugc);
              if (! (maze[x][y] & WALL_BOTTOM))
                draw_solid_square(x, y, WALL_BOTTOM, ugc);
            }
          }
        }
      }
    wait_sync ();
}
 
static void
solve_maze (void)                     /* solve it with graphical feedback */
{
    int i, dir, from, x, y, ways, bt = 0;
 
    /* plug up the surrounding wall */
    maze[end_x][end_y] |= (WALL_TOP >> end_dir);
 
    /* initialize search path */
    i = 0;
    path[i].x = end_x;
    path[i].y = end_y;
    path[i].dir = 0;
    maze[end_x][end_y] |= SOLVER_VISIT;
 
    /* do it */
    while (1)
    {
        if ( maze[path[i].x][path[i].y] & START_SQUARE )
            return;
 
        if (solve_delay) usleep(solve_delay);
 
        if(!path[i].dir)
        {
            ways = 0;
            /* First visit this square.  Which adjacent squares are open? */
            for(dir = WALL_TOP; dir & WALL_ANY; dir >>= 1)
            {
                if(maze[path[i].x][path[i].y] & dir)
                    continue;
 
                y = path[i].y - !!(dir & WALL_TOP) + !!(dir & WALL_BOTTOM);
                x = path[i].x + !!(dir & WALL_RIGHT) - !!(dir & WALL_LEFT);
 
                if(maze[x][y] & SOLVER_VISIT)
                    continue;
 
                from = (dir << 2 & WALL_ANY) | (dir >> 2 & WALL_ANY);
                /* don't enter obvious dead ends */
                if(((maze[x][y] & WALL_ANY) | from) != WALL_ANY)
                {
                    if(!longdeadend_p(path[i].x, path[i].y, x, y, dir))
                        ways |= dir;
                }
                else
                {
                    draw_solid_square(x, y, from, sgc);
                    maze[x][y] |= SOLVER_VISIT;
                }
            }
        }
        else
            ways = path[i].ways;
        /* ways now has a bitmask of open paths. */
 
        if(!ways)
            goto backtrack;
 
        if (!ignorant_p)
          {
            x = path[i].x - start_x;
            y = path[i].y - start_y;
            /* choice one */
            if(abs(y) <= abs(x))
              dir = (x > 0) ? WALL_LEFT : WALL_RIGHT;
            else
              dir = (y > 0) ? WALL_TOP : WALL_BOTTOM;
 
            if(dir & ways)
              goto found;
 
            /* choice two */
            switch(dir)
              {
              case WALL_LEFT:
              case WALL_RIGHT:
                dir = (y > 0) ? WALL_TOP : WALL_BOTTOM; break;
              case WALL_TOP:
              case WALL_BOTTOM:
                dir = (x > 0) ? WALL_LEFT : WALL_RIGHT;
              }
 
            if(dir & ways)
              goto found;
 
            /* choice three */
 
            dir = (dir << 2 & WALL_ANY) | (dir >> 2 & WALL_ANY);
            if(dir & ways)
              goto found;
 
            /* choice four */
            dir = ways;
            if(!dir)
              goto backtrack;
 
          found: ;
          }
        else
          {
            if(ways&WALL_TOP)
              dir = WALL_TOP;
            else if(ways&WALL_LEFT)
              dir = WALL_LEFT;
            else if(ways&WALL_BOTTOM)
              dir = WALL_BOTTOM;
            else if(ways&WALL_RIGHT)
              dir = WALL_RIGHT;
            else
              goto backtrack;
          }
        bt = 0;
        ways &= ~dir;  /* tried this one */
 
        y = path[i].y - !!(dir & WALL_TOP) + !!(dir & WALL_BOTTOM);
        x = path[i].x + !!(dir & WALL_RIGHT) - !!(dir & WALL_LEFT);
 
        /* advance in direction dir */
        path[i].dir = dir;
        path[i].ways = ways;
        draw_solid_square(path[i].x, path[i].y, dir, tgc);
 
        i++;
        path[i].dir = 0;
        path[i].ways = 0;
        path[i].x = x;
        path[i].y = y;
        maze[x][y] |= SOLVER_VISIT;
        continue;
 
    backtrack:
        if(i == 0)
        {
            printf("Unsolvable maze.\n");
            return;
        }
 
        if(!bt && !ignorant_p)
            find_dead_regions();
        bt = 1;
        from = path[i-1].dir;
        from = (from << 2 & WALL_ANY) | (from >> 2 & WALL_ANY);
 
        draw_solid_square(path[i].x, path[i].y, from, cgc);
        i--;
    }
}
 
/*
 *  jmr additions for Jamie Zawinski's <jwz@jwz.org> screensaver stuff,
 *  note that the code above this has probably been hacked about in some
 *  arbitrary way.
 */
 
void init_maze ()
{
  int size;
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  size = 0;
  solve_delay = 5000;
  pre_solve_delay = 2000000;
  post_solve_delay = 4000000;
  max_length = 5;
  bridge_p = 0;
  ignorant_p = 0;
 
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  if (size < 2) size = 7 + (random () % 30);
  grid_width = grid_height = size;
  bw = (size > 6 ? 3 : (size-1)/2);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  x = 0;
  y = 0;
 
  set_maze_sizes (WINDOW_WIDTH, WINDOW_HEIGHT);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  gc  = GrNewGC();
  cgc = GrNewGC();
  tgc = GrNewGC();
  sgc = GrNewGC();
  ugc = GrNewGC();
  erase_gc = GrNewGC();
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  GrSetGCForeground (gc, WHITE);
  GrSetGCBackground (gc, BLACK);
  GrSetGCForeground (cgc, RED);
  GrSetGCBackground (cgc, BLACK);
  GrSetGCForeground (tgc, LTGREEN);
  GrSetGCBackground (tgc, BLACK);
  GrSetGCForeground (sgc, BROWN);
  GrSetGCBackground (sgc, BLACK);
  GrSetGCForeground (ugc, BLUE);
  GrSetGCBackground (ugc, BLACK);
  GrSetGCForeground (erase_gc, BLACK);
  GrSetGCBackground (erase_gc, BLACK);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
  restart = 1;
 
  sync_p = !(random() % 10);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
}
 
static int this_gen, generator = -1;
void do_clock ()
{
  {
_print ("%i", state);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
    fflush (stdout);
    if (restart || stop) goto pop;
    switch (state) {
    case 1:
      initialize_maze();
      break;
    case 2:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      GrFillRect (wid, erase_gc, 0, 0, WINDOW_WIDTH, WINDOW_HEIGHT);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      draw_maze_border();
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      break;
    case 3:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      this_gen = generator;
      if(this_gen<0 || this_gen>2)
        this_gen = random()%3;
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      switch(this_gen)
        {
        case 0:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
          create_maze();
          break;
        case 1:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
          alt_create_maze();
          break;
        case 2:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
          set_create_maze();
          break;
        }
      break;
    case 4:
      wait_sync ();
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      usleep(pre_solve_delay);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      break;
    case 5:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      solve_maze();
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      break;
    case 6:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      wait_sync ();
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      usleep(post_solve_delay);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      state = 0 ;
      erase_full_window();
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      break;
    default:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      abort ();
    }
    ++state;
  pop:
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
    if (restart)
      {
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
        restart = 0;
        stop = 0;
        state = 1;
        set_maze_sizes (WINDOW_WIDTH, WINDOW_HEIGHT);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
        GrFillRect (wid, erase_gc, 0, 0, WINDOW_WIDTH, WINDOW_HEIGHT);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
        wait_sync ();
        sync_p = !(random() % 10);
_print("%s - %s:%d\n",__FILE__,__FUNCTION__,__LINE__);
      }
  }
}
 
Browse

Tools

Subversion Repositories or1k_old

[/] [or1k_old/] [trunk/] [mw/] [src/] [demos/] [nanox/] [maze.c] - Blame information for rev 1782

Line No.	Rev	Author	Line
1	770	simons	`/******************************************************************************`
2			`* [ maze ] ...`
3			`*`
4			`* modified: [ 1-04-00 ] Johannes Keukelaar <johannes@nada.kth.se>`
5			`* Added -ignorant option (not the default) to remove knowlege`
6			`* of the direction in which the exit lies.`
7			`*`
8			`* modified: [ 6-28-98 ] Zack Weinberg <zack@rabi.phys.columbia.edu>`
9			`*`
10			`* Made the maze-solver somewhat more intelligent. There are`
11			`* three optimizations:`
12			`*`
13			`* - Straight-line lookahead: the solver does not enter dead-end`
14			`* corridors. This is a win with all maze generators.`
15			`*`
16			`* - First order direction choice: the solver knows where the`
17			`* exit is in relation to itself, and will try paths leading in`
18			`* that direction first. This is a major win on maze generator 1`
19			`* which tends to offer direct routes to the exit.`
20			`*`
21			`* - Dead region elimination: the solver already has a map of`
22			`* all squares visited. Whenever it starts to backtrack, it`
23			`* consults this map and marks off all squares that cannot be`
24			`* reached from the exit without crossing a square already`
25			`* visited. Those squares can never contribute to the path to`
26			`* the exit, so it doesn't bother checking them. This helps a`
27			`* lot with maze generator 2 and somewhat less with generator 1.`
28			`*`
29			`* Further improvements would require knowledge of the wall map`
30			`* as well as the position of the exit and the squares visited.`
31			`* I would consider that to be cheating. Generator 0 makes`
32			`* mazes which are remarkably difficult to solve mechanically --`
33			`* even with these optimizations the solver generally must visit`
34			`* at least two-thirds of the squares. This is partially`
35			`* because generator 0's mazes have longer paths to the exit.`
36			`*`
37			`* modified: [ 4-10-97 ] Johannes Keukelaar <johannes@nada.kth.se>`
38			`* Added multiple maze creators. Robustified solver.`
39			`* Added bridge option.`
40			`* modified: [ 8-11-95 ] Ed James <james@mml.mmc.com>`