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

uprava podmienok

Browse Source
This commit is contained in:
Valér Jakubčo 2022-01-22 01:27:59 +01:00
parent 7eccafba51
commit 0f311fe1f2
1 changed files with 14 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
sk1a/maze.c
View File

@ -5,26 +5,31 @@
#include <math.h> #include <math.h>
int paths(char* maze, int journey, int size){ int paths(char* maze, int journey, int size){
//printf("journy je:%d\n",journey);
if(journey == size*size-1){ if(journey == size*size-1){
maze[journey]= '*'; maze[journey]= '*';
return 1; return 1;
} }
if(journey >= 0 && journey <= (size*size) && maze[journey]==' ' && maze[journey]!='*'){ if(journey >= 0 && journey < (size*size) && maze[journey]==' '){
maze[journey] = '*'; maze[journey] = '*';
//Pohyb dole //Pohyb dole
if(journey < (size * size) - (size)){
if(paths(maze, journey+size, size)){ if(paths(maze, journey+size, size)){
return 1; return 1;
} }
}
//Pohyb vpravo //Pohyb vpravo
if(paths(maze, journey+1, size)){ if(((journey+1)%size)!=0) {
if (paths(maze, journey + 1, size)) {
return 1; return 1;
} }
}
//Pohyb hore //Pohyb hore
if(paths(maze, journey-size, size)){ if(paths(maze, journey-size, size)){
@ -45,4 +50,3 @@ int paths(char* maze, int journey, int size){
int solve_maze(char* maze, int size){ int solve_maze(char* maze, int size){
return paths(maze, 0, size); return paths(maze, 0, size);
} }