mm823od/pvjc24
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

111111

Browse Source
This commit is contained in:
Macko 2024-04-10 23:35:50 +02:00
parent e48d2bf689
commit 52d7eeffe3
1 changed files with 9 additions and 25 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

34
cv9/snake.c
View File

@ -1,6 +1,7 @@
#include "snake.h"
#include <stdlib.h>
// Pridá novú časť hada na danú pozíciu a vráti novú hlavu hada
struct snake* add_snake(struct snake* snake, int x, int y) {
struct snake* new_head = (struct snake*) malloc(sizeof(struct snake));
new_head->x = x;
@ -9,29 +10,7 @@ struct snake* add_snake(struct snake* snake, int x, int y) {
return new_head;
}
/*struct snake* remove_snake(struct snake* snake) {
struct snake* temp = snake;
while(temp->next->next != NULL) {
temp = temp->next;
}
free(temp->next);
temp->next = NULL;
return snake;
}*/
/*struct snake* remove_snake(struct snake* snake) {
if (snake == NULL) {
return NULL;
}
struct snake* temp = snake;
while(temp->next->next != NULL) {
temp = temp->next;
}
free(temp->next);
temp->next = NULL;
return snake;
}*/
// Odstráni poslednú časť hada a vráti novú hlavu hada
struct snake* remove_snake(struct snake* snake) {
if (snake == NULL || snake->next == NULL) {
return NULL;
@ -45,8 +24,7 @@ struct snake* remove_snake(struct snake* snake) {
return snake;
}
// Zistí, či sú dané súradnice súčasťou hada
int is_snake(struct snake* snake, int x, int y) {
while(snake != NULL) {
if(snake->x == x && snake->y == y) {
@ -57,6 +35,7 @@ int is_snake(struct snake* snake, int x, int y) {
return 0;
}
// Uvoľní pamäť všetkých častí hada
void free_snake(struct snake* snake) {
struct snake* temp;
while(snake != NULL) {
@ -66,18 +45,22 @@ void free_snake(struct snake* snake) {
}
}
// Zmení stav hry podľa pravidiel hry
int step_state(struct state* state) {
int new_x = state->snake->x + state->sx;
int new_y = state->snake->y + state->sy;
// Ak je nová pozícia mimo hracej plochy, vráti END_WALL
if(new_x < 0 || new_x >= state->width || new_y < 0 || new_y >= state->height) {
return END_WALL;
}
// Ak je nová pozícia na hadovi, vráti END_SNAKE
if(is_snake(state->snake, new_x, new_y)) {
return END_SNAKE;
}
// Ak je nová pozícia na jedle, označí jedlo ako zjedené a pridá novú časť hada
for(int i = 0; i < FOOD_COUNT; i++) {
if(state->foodx[i] == new_x && state->foody[i] == new_y) {
state->foodx[i] = -1;
@ -92,6 +75,7 @@ int step_state(struct state* state) {
}
}
// Ak je nová pozícia voľná, pridá novú časť hada a odstráni poslednú časť
state->snake = add_snake(state->snake, new_x, new_y);
state->snake = remove_snake(state->snake);