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

hm

Browse Source
This commit is contained in:
Valér Jakubčo 2022-01-22 01:57:10 +01:00
parent 9c8babdb69
commit c5a4386d1e
1 changed files with 15 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
sk1a/maze.c
View File

@ -5,6 +5,7 @@
#include <math.h>
int paths(char* maze, int journey, int size){
//printf("journy je:%d\n",journey);
if(journey == size*size-1){
maze[journey]= '*';
@ -12,19 +13,23 @@ int paths(char* maze, int journey, int size){
}
if(journey >= 0 && journey < (size*size) && maze[journey]==' '){
maze[journey] = '*';
maze[journey] = '*';
//Pohyb dole
if(paths(maze, journey+size, size)){
return 1;
}
if(journey < (size * size) - (size)){
if(paths(maze, journey+size, size)){
return 1;
}
}
//Pohyb vpravo
if(paths(maze, journey+1, size)){
return 1;
}
if((journey+1)%size!=0) {
if (paths(maze, journey + 1, size)) {
return 1;
}
}
//Pohyb hore
if(paths(maze, journey-size, size)){
@ -32,11 +37,11 @@ int paths(char* maze, int journey, int size){
}
//Pohyb vlavo
if(size%journey!=0){
if((journey%size)!=0){
if(paths(maze, journey-1, size))
return 1;
}
maze[journey] = ' ';
}
@ -46,4 +51,3 @@ int paths(char* maze, int journey, int size){
int solve_maze(char* maze, int size){
return paths(maze, 0, size);
}