/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   get_smallest_square.c                              :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2019/04/12 22:29:45 by vmanzoni          #+#    #+#             */
/*   Updated: 2019/04/24 21:01:26 by vmanzoni         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

#include "fillit.h"

/*
** Function that initialize a int map equivalent to a square size*size
*/

unsigned int	*initialize_map(int size)
{
	unsigned int	*map[0];

	while (size--)
		map[size] = 0;
	return (map);
}

/*
** Function that bruteforce with backtracking for smallest square
*/

int				*get_smallest_square(t_fillist list, int size, unsigned int map[])
{
	unsigned int	mask;
	int				i;
	int				j;

	i = 0;
	mask = map[size];
	while (list.tetribit != NULL)
	{
		mask = (mask >> 1) | (((1 << (i % 32)) & map[j]) << (31 - (i % 32)));
		if (!(tetri & mask))
			return (1);
		i++;
	}
	return (0);
}