dk160am/usaa21
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Delete 'sk1a/readme.md'

Browse Source
This commit is contained in:
Damián Korpesio 2022-01-20 07:46:16 +00:00
parent 6fe366ba49
commit a7f628872d
1 changed files with 0 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

42
sk1a/readme.md
View File

@ -1,42 +0,0 @@
#include <stdio.h>
#include <string.h>
#include "maze.h"
#include <assert.h>
int issafe(char* maze, int x, int y, int size) {
if ((x >= 0 && x < size) && (y >= 0 && y < size) && (maze[x * size + y] == ' ')){
return 1;
}
return 0;
}
int backtracking(char* maze, int x, int y, int size){ //https://www.geeksforgeeks.org/rat-in-a-maze-backtracking-2/
if(x == size - 1 && y == size - 1 && maze[x * size + y] == ' '){ //kontrola ci sa nachadzam na konci
maze[x * size + y] = '*';
return 1;
}
if(issafe(maze, x, y, size) == 1) { // znazornenie stien
maze[x * size + y] = '*';
if (backtracking(maze, x, y + 1, size) == 1) { //pohyb doprava
return 1;
}
if (backtracking(maze, x + 1, y, size) == 1) { //pohyb dole
return 1;
}
if (backtracking(maze, x - 1, y, size) == 1) { //pohyb dol
return 1;
}
if (backtracking(maze, x, y - 1, size) == 1) { //pohyb hore
return 1;
}
maze[x * size + y] = ' ';
}
return 0;
}
int solve_maze(char* maze, int size) {
return backtracking(maze, 0, 0, size); //volanie funkcie
}