left.c

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

#define MAX 5

int map2[MAX][MAX]= { 
  { 1,1,1,1,1},
  { 2,0,0,0,1},
  { 1,0,1,0,1},
  { 1,0,1,0,3},
  { 1,1,1,1,1} };
  
int map[MAX][MAX]={
  {1,2,1,1,1},
  {1,0,0,0,3},
  {1,0,1,1,1},
  {1,0,0,0,1},
  {1,1,1,1,1}
};

int now_x=0,now_y=0;
char dir='R';


int getWall(){
  //printf("getDir\n");
  switch (dir){
    case'R':if(now_y-1<0 ||map[now_x][now_y-1]!=1)return 0;break;
    case'U':if( (now_x-1<0) || map[now_x-1][now_y]!=1)return 0;break;
    case'L':if ( map[now_x][now_y+1]!=1)return 0;break;
    case'D':if(map[now_x+1][now_y]!=1)return 0;break;
  }
  return 1;
}

void turnLeft(){
  //printf("Left\n");
  switch (dir){
    case'R':dir = 'U';now_y--;break;
    case'U':dir = 'L';now_x--;break;
    case'L':dir = 'D';now_y++;break;
    case'D':dir = 'R';now_x++;break;
    default:
    ;
  }
  
}

void turnRight(){
  //printf("Right\n");
  switch (dir){
    case'R':dir = 'D';break;
    case'U':dir = 'R';break;
    case'L':dir = 'U';break;
    case'D':dir = 'L';break;
    default:
    return ;
  }
}

int main(){
  int i,j;
  
  for(i=0;i<MAX;i++){
    for(j=0;j<MAX;j++){
      if(map[i][j]==2){
        now_x=i;now_y=j;
      }
      //printf("i = %d,j = %d\n",i,j);
    }
  }
  
  printf("start!!\n");
  
  while(!(map[now_x][now_y]==3)){
    printf("dir=%c now_x = %d,now_y = %d \n",dir ,now_x,now_y);
    if(getWall()){
      turnRight();
    }else{turnLeft();}
    
    //getchar();
  }
  printf("clear!!\n");
}