static void ft_declare_winner(t_grid *game, int i, int j)
{
ft_print_grid(game);
if (GRID[i][j] == 'X')
ft_putendl("VOUS AVEZ GAGNE ! FELICITATIONS !");
else
ft_putendl("L'ORDINATEUR A GAGNE ! DEFAITE HUMILIANTE ?");
}
void ft_player_turn(t_grid **grid, int player)
{
int input;
ft_print_grid(*grid);
ft_print_info_player_turn(player);
input = ft_get_valid_col_input((*grid)->col);
while (ft_is_col_full(*grid, input))
input = ft_get_valid_col_input((*grid)->col);
ft_add_player_token(&(*grid), player, input);
ft_printf("\n\n");
}
int main(int argc, char **argv)
{
char grid[6][10]; //tableau fixe
if (ft_verif_parameter(argc, argv) == 1)
{
ft_putstr("Erreur\n");
return (0);
}
ft_init_grid(argc, argv, grid);
ft_solve(grid, 0);
ft_print_grid(grid);
return (0);
}
int main(int argc, char *argv[])
{
struct s_grid *grid;
if (ft_precheck(argc, argv) == 0)
{
ft_error();
return (0);
}
grid = ft_create_grid(argv);
if (fill_grid(grid, 0, 0) == 0)
{
ft_error();
return (0);
}
ft_print_grid(grid);
return (0);
}
void ft_solve(t_gridinfo *info, t_tetriminos *shapes, int i, char *grid)
{
int result;
while ((*info).index < (*info).total)
{
result = ft_resolve(shapes, info, i, grid);
if (result == -1)
{
free(grid);
(*info).width += 1;
grid = ft_make_grid(((*info).width - 1));
(*info).index = 0;
i = 0;
}
}
ft_print_grid(grid);
}
int main(int argc, char **argv)
{
int fd;
int ret;
char buf[22];
char **tab;
char ***tetro_tab = NULL;
char **map;
int i;
argc= argc+1;
i = 0;
tab = (char**)malloc(sizeof(char*) * 27);
fd = open(argv[1], O_RDONLY);
if (fd == -1)
{
ft_putstr("open() error\n");
return (0);
}
while (((ret = read(fd, buf, 21)) > 20) && i < 27)
{
buf[ret] = '\0';
tab[i] = (char*)malloc(sizeof(char) * (ft_strlen(buf) + 1));
tab[i] = ft_strcpy(tab[i], buf);
if (ft_verif_tetro(tab[i]) == 0 || ft_stick_verif(tab[i]) == 0)
{
ft_putnbr(i);
ft_putstr("tetromino error");
return (0);
}
i++;
}
buf[ret] = '\0';
tab[i] = (char*)malloc(sizeof(char) * (ft_strlen(buf) + 1));
tab[i] = ft_strcpy(tab[i], buf);
tab[i + 1] = NULL;
if (ft_verif_tetro(tab[i]) == 1 && ft_stick_verif(tab[i]) == 1 && i < 27)
{
up_left_pieces(tab);
ft_to_letters(tab, i);
i++;
tetro_tab = ft_bigger_tab(tab, i);
// printf("\n\n\n\n");
ft_print_grid(ft_sqrt_rounded_up(i * 4));
map = ft_print_grid(ft_sqrt_rounded_up(i * 4));
while (!backtracking(map, tetro_tab, 0))
{
ft_putstr("COUCOU JE SUIS ENTRE");
ft_puttab(map);
ft_putchar(10);
map = up_map(map);
ft_puttab(map);
}
printf("COUCOU JE SUIS SORTI\n");
ft_puttab(map);
ft_putchar(10);
return (1);
}
return (0);
}
