84 lines
2.0 KiB
C
84 lines
2.0 KiB
C
#include "snake.h"
|
|
#include <stdlib.h>
|
|
|
|
#define FOOD_COUNT 20
|
|
|
|
struct state {
|
|
struct snake* snake;
|
|
int sx, sy;
|
|
int width, height;
|
|
int foodx[FOOD_COUNT], foody[FOOD_COUNT];
|
|
};
|
|
|
|
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;
|
|
new_head->y = y;
|
|
new_head->next = snake;
|
|
return new_head;
|
|
}
|
|
|
|
struct snake* remove_snake(struct snake* snake) {
|
|
if (snake == NULL || snake->next == NULL) {
|
|
return NULL;
|
|
}
|
|
struct snake* temp = snake;
|
|
while(temp->next->next != NULL) {
|
|
temp = temp->next;
|
|
}
|
|
free(temp->next);
|
|
temp->next = NULL;
|
|
return snake;
|
|
}
|
|
|
|
int is_snake(struct snake* snake, int x, int y) {
|
|
while(snake != NULL) {
|
|
if(snake->x == x && snake->y == y) {
|
|
return 1;
|
|
}
|
|
snake = snake->next;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
void free_snake(struct snake* snake) {
|
|
struct snake* temp;
|
|
while(snake != NULL) {
|
|
temp = snake;
|
|
snake = snake->next;
|
|
free(temp);
|
|
}
|
|
}
|
|
|
|
int step_state(struct state* state) {
|
|
int new_x = state->snake->x + state->sx;
|
|
int new_y = state->snake->y + state->sy;
|
|
|
|
if(new_x < 0 || new_x >= state->width || new_y < 0 || new_y >= state->height) {
|
|
return END_WALL;
|
|
}
|
|
|
|
if(is_snake(state->snake, new_x, new_y)) {
|
|
return END_SNAKE;
|
|
}
|
|
|
|
for(int i = 0; i < FOOD_COUNT; i++) {
|
|
if(state->foodx[i] == new_x && state->foody[i] == new_y) {
|
|
state->foodx[i] = -1;
|
|
state->foody[i] = -1;
|
|
state->snake = add_snake(state->snake, new_x, new_y);
|
|
for(int j = 0; j < FOOD_COUNT; j++) {
|
|
if(state->foodx[j] != -1) {
|
|
return END_CONTINUE;
|
|
}
|
|
}
|
|
return END_FOOD;
|
|
}
|
|
}
|
|
|
|
state->snake = add_snake(state->snake, new_x, new_y);
|
|
state->snake = remove_snake(state->snake);
|
|
|
|
return END_CONTINUE;
|
|
}
|