A minimum working (hope so!) version of the algorithm is working, although
it says levels/02 is unsolvable.
Now the solution is printed map by map.
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <unistd.h>
#include <signal.h>
#include <assert.h>
#include "general.h"
/* Things related to the showing of the status */
float percent_to_show = 0;
int depth_to_show = 0;
int max_depth = 0;
int min_depth_period = 0;
int max_depth_period = 0;
struct Map * actual_map;
void ReadMap(struct Map *M, char *FileName)
{
FILE *Fitxer;
int i,j;
if(!(Fitxer = fopen(FileName, "r")))
{
printf("Error opening %s!", FileName);
exit(1);
}
M->SizeX=0;
M->SizeY=0;
while (!feof(Fitxer))
{
fgets(M->Cells[M->SizeY], MAX_X, Fitxer);
M->SizeY++;
}
M->SizeY--;
M->SizeX = strlen(M->Cells[0]) - 1;
M->NumPlatforms = 0;
M->NumBoxesInPlatform = 0;
M->NumBoxes = 0;
for (j = 0; j<M->SizeY; j++)
for (i=0; i<M->SizeX; i++)
{
if (M->Cells[j][i] == MAN)
{
M->Man.x = i; M->Man.y = j;
M->Cells[M->Man.y][M->Man.x] = BLANK;
}
if (M->Cells[j][i] == PLATFORM)
M->NumPlatforms++;
else if (M->Cells[j][i] == BOXINPLATFORM)
{
M->Cells[j][i] = PLATFORM;
M->NumPlatforms++;
M->NumBoxesInPlatform++;
M->Box[M->NumBoxes].x = i;
M->Box[M->NumBoxes].y = j;
M->NumBoxes++;
} else if (M->Cells[j][i] == BOX)
{
M->Cells[j][i] = BLANK;
M->Box[M->NumBoxes].x = i;
M->Box[M->NumBoxes].y = j;
M->NumBoxes++;
} else if (M->Cells[j][i] == CORNER)
{
M->Cells[j][i] = CORNER;
} else if (M->Cells[j][i] != WALL)
{
if ( (M->Cells[j][i-1] == WALL &&
M->Cells[j-1][i] == WALL) ||
(M->Cells[j][i-1] == WALL &&
M->Cells[j+1][i] == WALL) ||
(M->Cells[j][i+1] == WALL &&
M->Cells[j-1][i] == WALL) ||
(M->Cells[j][i+1] == WALL &&
M->Cells[j+1][i] == WALL))
M->Cells[j][i] = CORNER;
}
}
}
void ShowMap (const struct Map *M)
{
struct Map Temp;
int i,j;
CopyMap(&Temp, M);
Temp.Cells[Temp.Man.y][Temp.Man.x] = MAN;
for (i = 0; i < Temp.NumBoxes; i++)
{
if (Temp.Cells[Temp.Box[i].y][Temp.Box[i].x] == PLATFORM)
Temp.Cells[Temp.Box[i].y][Temp.Box[i].x] =BOXINPLATFORM;
else
Temp.Cells[Temp.Box[i].y][Temp.Box[i].x] = BOX;
}
for (j = 0; j<Temp.SizeY; j++)
{
for (i=0; i<Temp.SizeX; i++)
fprintf(stderr,"%c", Temp.Cells[j][i]);
fprintf(stderr,"\n");
}
#if 0
/* Print Where the man can move */
for (j = 0; j<Temp.SizeY; j++)
{
for (i=0; i<Temp.SizeX; i++)
printf("%c", Temp.ManMoves[j][i]);
printf("\n");
}
#endif
fprintf(stderr,"Man is at (%i,%i)\n", Temp.Man.x, Temp.Man.y);
fprintf(stderr,"Platforms: %i, BoxesInPlatform: %i\n", Temp.NumPlatforms,
Temp.NumBoxesInPlatform);
}
void PrintMove(const struct BoxMove b)
{
fprintf(stderr,"Box: %i, Direction: {%i,%i}\n", b.box, b.dir.x, b.dir.y);
}
void show_percent_and_map()
{
fprintf(stderr, "Percent: %2.12f, depth: %i-%i\n", percent_to_show,
min_depth_period, max_depth_period);
ShowMap(actual_map);
fflush(stderr);
min_depth_period = MAX_STEPS;
max_depth_period = 0;
}
static void show_percent_callback(const int parameter)
{
show_percent_and_map();
alarm(ALARM_SECONDS);
}
static void program_alarm()
{
struct sigaction my_action;
int result;
my_action.sa_handler = show_percent_callback;
my_action.sa_flags = 0;
memset(&my_action.sa_mask, 0, sizeof(my_action.sa_mask));
result = sigaction(SIGALRM, &my_action, NULL);
assert(result == 0);
alarm(1);
}
void init_os()
{
#ifndef DEBUG
program_alarm();
#endif
}