36 lines
539 B
C
36 lines
539 B
C
/* Fonction qui mets à jour la position de la queue en fonction des déplacement du serpent
|
|
|
|
Written by Yann KERAUDREN and Titouan LERICHE */
|
|
|
|
|
|
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
|
|
|
|
void maj_queue(int* queue, int** p) {
|
|
|
|
if ( p[queue[0] +1 ][queue[1]] == 1 ) {
|
|
|
|
queue[0] = queue[0] +1 ;
|
|
|
|
}
|
|
|
|
if ( p[queue[0] - 1][queue[1]] == 1 ) {
|
|
|
|
queue[0] = queue[0] -1;
|
|
}
|
|
|
|
if ( p [queue[0]][queue[1]+1] == 1) {
|
|
|
|
queue[1] = queue [1] +1;
|
|
|
|
}
|
|
|
|
if ( p [queue[0]][queue[1]-1] == 1) {
|
|
|
|
queue[1] = queue[1] -1;
|
|
|
|
}
|
|
|
|
}
|