OS_Connect4/functions.c at master · AldeIT/OS_Connect4 · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
#include "F4.h"

void print_banner(){
    printf("______                    ___ \n");
    printf("|  ___|                  /   |\n");
    printf("| |_ ___  _ __ ______ _ / /| |\n");
    printf("|  _/ _ \\| '__|_  / _` / /_| |\n");
    printf("| || (_) | |   / / (_| \\___  |\n");
    printf("\\_| \\___/|_|  /___\\__,_|   |_/\n");
    printf("\n");
}

int string_to_int(char * string){
    int index = 0;
    int value = 0;
    if (string[0]=='-')return -1;
    while (string[index]!='\0')
    {
        value *= 10;
        value += string[index] - 48;
        index ++;
    }

    return value;

}

int get_coordinates(int N, int M, int x, int y){
    return M*x + y;
}

void matrix_init(int * matrix, int N, int M){
    for (int i = 0; i < N; i++){
        for (int y = 0; y < M; y++){
            matrix[get_coordinates(N, M, i, y)] = MATRIX_DEFAULT_CHAR;
        }
    }
}

void print_matrix(int * matrix, int N, int M){

    for (int x = 0; x < M*4+1; x++){
        printf("_");
    }
    printf("\n\n");

    for (int i = 0; i < N; i++){
        for (int y = 0; y < M; y++){
            if (y == M - 1){
                printf("%c | \n", matrix[get_coordinates(N, M, i, y)]);
            }else if(y == 0){
                printf("| %c | ", matrix[get_coordinates(N, M, i, y)]);
            }else{
                printf("%c | ", matrix[get_coordinates(N, M, i, y)]);
            }

        }
        for (int x = 0; x < M*4+1; x++){
            printf("_");
        }
        printf("\n\n");
    }
}

int make_move(int * matrix, int N, int M, int col, char symbol){

    col--;

    if (col>=M || col < 0){
        printf("Warning! Value not acceptable\n");
        return -1;
    }
    int i = 0;
    while(matrix[get_coordinates(N, M, i, col)]==MATRIX_DEFAULT_CHAR){
        i++;
    }

    if (i == 0){
        printf("Warning! The selected column is already full\n");
        return -1;
    }

    matrix[get_coordinates(N, M, i-1, col)] = symbol;

    return 1;
}

int check_winner(int *matrix, int n, int m, char symbol){
	/* Checking if the matrix is full. */
    int counter = 0;
    for(int i=0; i<n; i++){
        for(int y=0; y<m; y++){
            if(matrix[get_coordinates(n,m,i,y)]!=MATRIX_DEFAULT_CHAR)
                counter++;
            else
                break;
        }
    }
    if(counter == m*n)
        return -1;

	/* checking the horizontal lines */
    for (int y = 0; y<m-3 ; y++ ){  //-3 because checking the 3 elements after the current
        for (int i = 0; i<n; i++){
            if (matrix[get_coordinates(n, m, i, y)] == symbol && matrix[get_coordinates(n, m, i, y+1)] == symbol && matrix[get_coordinates(n, m, i, y+2)] == symbol && matrix[get_coordinates(n, m, i, y+3)] == symbol){
                return 1;
            }
        }
    }

	/* checking the vertical lines */
    for (int i = 0; i<n-3 ; i++ ){	//well, same as above
        for (int y = 0; y<m; y++){
            if (matrix[get_coordinates(n, m, i, y)] == symbol && matrix[get_coordinates(n, m, i+1, y)] == symbol && matrix[get_coordinates(n, m, i+2, y)] == symbol && matrix[get_coordinates(n, m, i+3, y)] == symbol){
                return 1;
            }
        }
    }

    /* checking the ascending diagonals (/) */
    for (int i=0; i<m-3; i++){
        for (int y=3; y<n; y++){
            if (matrix[get_coordinates(n, m, y, i)] == symbol && matrix[get_coordinates(n, m, y-1, i+1)] == symbol && matrix[get_coordinates(n, m, y-2, i+2)] == symbol && matrix[get_coordinates(n, m, y-3, i+3)] == symbol){
                return 1;
            }
        }
    }

    /* checking the descending diagonals (\) */
    for (int i=0; i<m-3; i++){
        for (int y=0; y<n-3; y++){
            if (matrix[get_coordinates(n, m, i, y)] == symbol && matrix[get_coordinates(n, m, i+1, y+1)] == symbol && matrix[get_coordinates(n, m, i+2, y+2)] == symbol && matrix[get_coordinates(n, m, i+3, y+3)] == symbol)
                return 1;
        }
    }
	return 0;
}

int isNumeric(char* string){
    int count = 0;
    while (string[count]!='\0'){
        if (string[count] <'0' || string[count] > '9')return 0;
        count++;
    }
    return 1;
}

/************************************
*VR471346, VR471414, VR471404
*Aldegheri Alessandro, Venturi Davide, Zerman Nicolò
*15/04/2023
*************************************/