Thread: Classic maze problem

Code:

#include <stdio.h>
#include <stdlib.h>

void printMaze( const char maze[][12] ){
	int i, j;
	
	system("cls");
	
	for( i = 0 ; i < 12 ; i++ )
		for( j = 0 ; j < 12 ; j++ ){
			printf("%c", maze[i][j] );
			if( j == 11 )
				putchar('\n');
		}
}

void mazeTraverse( char maze[][12], int row, int col ){
  // this function is suppose to make it's way through
  // maze. If you follow the "wall" to your right you will
  // eventually make your way through the maze.
  // I just haven't figured out an algorithm :(
	
		
	
}
	


int main(void){
	const char maze[12][12]= {
		{ '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' },
		{ '#', '.', '.', '.', '#', '.', '.', '.', '.', '.', '.', '#' },
		{ '.', '.', '#', '.', '#', '.', '#', '#', '#', '#', '.', '#' },
		{ '#', '#', '#', '.', '#', '.', '.', '.', '.', '#', '.', '#' },
		{ '#', '.', '.', '.', '.', '#', '#', '#', '.', '#', '.', '.' },
		{ '#', '#', '#', '#', '.', '#', '.', '#', '.', '#', '.', '#' },
		{ '#', '.', '.', '#', '.', '#', '.', '#', '.', '#', '.', '#' },
		{ '#', '#', '.', '#', '.', '#', '.', '#', '.', '#', '.', '#' },
		{ '#', '.', '.', '.', '.', '.', '.', '.', '.', '#', '.', '#' },
		{ '#', '#', '#', '#', '#', '#', '.', '#', '#', '#', '.', '#' },
		{ '#', '.', '.', '.', '.', '.', '.', '#', '.', '.', '.', '#' },
		{ '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#', '#' }
		};
	
	mazeTraverse( maze, 2, 0 );


	return 0;
}

The '#' are the maze walls, and the '.' are paths you can take. Any ideas is appreciated.

Originally posted by orbitz
Following the wall to your right is your algorithm.

Yes I know that but if you look at my function mazeTraverse, I haven't been able to figured it out. I tried one way but the 'X' goes back and forth.

There are countless posts and web sites for maze creation and solution. Search a bit and you'll easily find exactly what you need.

Recursion is most commonly used for solving. It's easy.

Code:

if( can_go( N ) )
    go( N )
if( can_go( E ) )
    go( E )
if( can_go( S ) )
    go( S )
if( can_go( W ) )
    go( W )

Mark each square as "visited" as you run across it. When you can't go anymore, backtrack (return) util you have a way to go.

Lather, rinse, repeat.

Quzah.