DotFeliph

#include <stdio.h> 
#include <stdlib.h>

#define tam 8
int board[tam];
int solutions_bf, solutions_backtracking;

long long brute_nodes;
long long back_nodes;

DotFeliph

#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <assert.h>

void MaxMin1(int *max, int *min, int n, int A[]);
void MaxMin2(int *max, int *min, int n, int A[]);
void MaxMin3(int *max, int *min, int n, int A[]);

void BestCase  (int A[]);