en cours de reorganisation des fichiers pour gerer les flags

f_bonus.c

@@ -0,0 +1,103 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   bonus.c                                            :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <marvin@42.fr>                      +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/05/24 14:42:46 by hulamy            #+#    #+#             */
+/*   Updated: 2019/05/24 14:46:08 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+** Test optimisation for not testing wrong maps when tetri are identical
+*/
+
+int		check_tetri_memory(t_fillist *list, int pos)
+{
+	t_fillist		*tetri;
+	unsigned int	mask;
+
+	tetri = list;
+	mask = 1 << ((pos % 32) - 1);
+	if (tetri->same)
+	{
+		if (!(tetri->same->memory[pos / 32] & mask))
+			return (tetri->same->memory[pos / 32] |= mask);
+	}
+	else
+	{
+//		if (!(tetri->memory[pos / 32] & mask))
+			return (tetri->memory[pos / 32] |= mask);
+	}
+	return (0);
+}
+
+void	remove_tetri_memory(t_fillist *list, int pos)
+{
+	t_fillist		*tetri;
+	unsigned int	mask;
+
+	tetri = list;
+	mask = 1 << ((pos % 32) - 1);
+	if (tetri->same != NULL)
+	{
+		if ((tetri->same->memory[pos / 32] & mask))
+			tetri->same->memory[pos / 32] ^= mask;
+	}
+	else
+	{
+		if ((tetri->memory[pos / 32] & mask))
+			tetri->memory[pos / 32] ^= mask;
+	}
+}
+
+/*
+** Test optimisation for not testing wrong maps when tetri are identical
+*/
+
+int		compare_tetri(t_fillist *tetri_a, t_fillist *tetri_b)
+{
+	if (tetri_a->tetribit != tetri_b->tetribit)
+		return (0);
+	if (tetri_a->width != tetri_b->width)
+		return (0);
+	if (tetri_a->height != tetri_b->height)
+			return (0);
+	return (1);
+}
+
+/*
+** Test optimisation for not testing wrong maps when tetri are identical
+*/
+
+int		check_same_tetri(t_fillist *list, int num)
+{
+	t_fillist	*curr_tetri;
+	t_fillist	*next_tetri;
+	int			i;
+
+	curr_tetri = list;
+	while (curr_tetri != NULL)
+	{
+		i = 0;
+		if (!(curr_tetri->memory = (unsigned int *)malloc(sizeof(*curr_tetri->memory) * num)))
+			return (0);
+		while (i < num)
+			curr_tetri->memory[i++] = 0;
+		next_tetri = curr_tetri->next;
+		while (next_tetri != NULL)
+		{
+			if (compare_tetri(curr_tetri, next_tetri))
+				if (next_tetri->same == NULL)
+					next_tetri->same = curr_tetri;
+			next_tetri = next_tetri->next;
+		}
+		curr_tetri = curr_tetri->next;
+	}
+	return (0);
+}
+

f_handle_errors.c

@@ -6,7 +6,7 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/03/01 13:29:05 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/05/09 12:45:25 by vmanzoni         ###   ########.fr       */
+/*   Updated: 2019/05/24 18:02:08 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -19,7 +19,7 @@
 void	print_error(char *str)
 {
 	write(1, str, ft_strlen(str));
-	exit(1);
+//	exit(1);
 }
 
 /*
@@ -28,8 +28,13 @@ void	print_error(char *str)
 ** and exit program
 */
 
-void	print_error_extended(int error)
+void	print_error_extended(int error, int *dope)
 {
+	if (!dope[3])
+	{
+		print_error("error\n");
+		exit(0);
+	}
 	if (error == 1)
 		ft_putstr("error: File contains char other than '.','#' and '\\n'.\n");
 	if (error == 2)
@@ -41,7 +46,7 @@ void	print_error_extended(int error)
 		ft_putstr("error: Tetrimino has more or less than 4 #.\n");
 	if (error == 5)
 		ft_putstr("error: Tetrimino # are not all connected.\n");
-	exit(1);
+//	exit(1);
 }
 
 /*
@@ -51,7 +56,7 @@ void	print_error_extended(int error)
 ** - two \n in a row
 */
 
-int		check_file_errors(char *file)
+void	check_file_errors(char *file, int *dope)
 {
 	int		i;
 	int		line_nbr;
@@ -61,19 +66,18 @@ int		check_file_errors(char *file)
 	while (file[i])
 	{
 		if (file[i] != '.' && file[i] != '#' && file[i] != '\n')
-			return (1);
+			print_error_extended(1, dope);
 		else if (file[i] == '\n')
 			line_nbr++;
 		if (file[i] == '\n' && line_nbr % 5 == 0 && file[i-1] != '\n')
-			print_error("error\n");
+			print_error("error\n");		// est-ce que ca n'imprime pas error deux fois ??
 		if (file[i] == '\n' && file[i+1] != '\0' && \
 			file[i+2] != '.' && file[i+2] != '#')
-			return (2);
+			print_error_extended(2, dope);
 		i++;
 	}
 	if (line_nbr < 4 || line_nbr > 129)
-		return (3);
-	return (0);
+		print_error_extended(3, dope);
 }
 
 /*

f_parse_input.c

@@ -6,7 +6,7 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/04/15 14:48:14 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/05/20 15:43:57 by hulamy           ###   ########.fr       */
+/*   Updated: 2019/05/24 18:04:46 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -126,7 +126,7 @@ int		add_to_list(char *line, t_fillist **list, char letter)
 ** Function that parse a file and put each tetrimino in a linked list
 */
 
-int		parse_input(char *input, t_fillist **list)
+int		parse_input(char *input, t_fillist **list, int *dope)
 {
 	char				tetri[20];
 	int					i;

f_print.c

@@ -6,7 +6,7 @@
 /*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/04/30 13:24:28 by hulamy            #+#    #+#             */
-/*   Updated: 2019/05/17 17:24:54 by hulamy           ###   ########.fr       */
+/*   Updated: 2019/05/22 14:34:45 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -82,7 +82,7 @@ void	print_final_map(t_fillist *list, int size, int flag)	// DEBUG flag vaut 0 p
 		{
 			if (i && i % tmp->width == 0)
 				j += size - tmp->width;
-			if (1 << (15 - i) & tmp->tetribit/* && tmp->test == 1*/)	// DEBUG "&& tmp->position != -1" pour imprimer les bonnes lettres au coours du debug
+			if (1 << (15 - i) & tmp->tetribit && tmp->test == 1)	// DEBUG "&& tmp->test == 1" pour imprimer les bonnes lettres au coours du debug
 				map[tmp->position + i + j - 1] = tmp->letter;
 		}
 		tmp = tmp->next;

f_search_map.c

@@ -0,0 +1,293 @@
+/* ************************************************************************** */
+/*                                                                            */
+/*                                                        :::      ::::::::   */
+/*   search_map.c                                       :+:      :+:    :+:   */
+/*                                                    +:+ +:+         +:+     */
+/*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
+/*                                                +#+#+#+#+#+   +#+           */
+/*   Created: 2019/04/27 20:47:22 by hulamy            #+#    #+#             */
+/*   Updated: 2019/05/24 14:48:33 by hulamy           ###   ########.fr       */
+/*                                                                            */
+/* ************************************************************************** */
+
+#include "fillit.h"
+
+/*
+**	OLD VERSION of find_place and fit_in_place all in one but with a lot of divisions and modulo
+**
+**	int		find_place(unsigned int *tab, t_fillist *list, int size, int pos)
+**	{
+**		int				i;
+**		int				j;
+**		unsigned int	mask;
+**		unsigned int	tmp;
+**	
+**		mask = ~0u << (32 - list->width);
+**		tmp = mask;
+**		i = pos;
+**		while (i < (size - list->height + 1) * size)
+**		{
+**			if (i % size == size - list->width + 1)
+**				i += list->width - 1;
+**			else
+**			{
+**				tmp = 0;
+**				j = (list->height - 1) * size + i;
+**				while (j >= i)
+**				{
+**					tmp >>= list->width;
+**					tmp |= (mask & (tab[j / 32] << j));
+**					tmp |= (mask & (tab[(j + list->width) / 32] >> (32 - j)));
+**					j -= size;
+**				}
+**				if (!((tmp >> 16) & list->tetribit))
+**					return (i + 1);
+**				i++;
+**			}
+**		}
+**		return (0);
+**	}
+*/
+
+/*
+** function that try to optimize the speed
+** SECOND ATTEMPT
+** by finding the isolated dots whille fillling the map
+** untill they get more numerous than the max amount available
+** TOTAL FAILURE :p
+**
+**	int		check_others(unsigned int *map, t_fillist *list, int size, int num)
+**	{
+**		t_fillist	*tmp;
+**		int			dots;
+**		int			total;
+**		int			i;
+**		int			j;
+**	
+**		dots = 0;
+**		i = -1;
+**		num *= 4;
+**		total = size * size;
+**		while (++i < total && dots <= total - num)
+**		{
+**			tmp = list->next;
+**			j = 1;
+**			// saute les position pas vides
+**			while (1 << (i % 32) & map[i % 32])
+**				i++;
+**			// pour chaque position vide regarde si chaque tetri non encode places peuvent y rentrer
+**			while (j && tmp)
+**			{
+**				// si le tetri est trop a droite ou trop en bas il ne rentre pas ce n'est pas la peine de chercher donc on passe au tetri suivant
+**				if (tmp->width > (size - i % size) || (total - i) <= (tmp->height * size))
+**					tmp = tmp->next;
+**				// sinon verifier si on peut le mettre a cette position et si on ne peut pas passer au tetri suivant
+**				else if (!fit_in_place(map, list, size, i))
+**					tmp = tmp->next;
+**				// si le tetri peut rentrer on arrete la boucle en mettant j = 0
+**				else
+**					j = 0;
+**			}
+**			// si j existe c que le tetri ne pouvait pas etre place donc on rajoute 1 au compteur de point isoles
+**			if (j)
+**				dots++;
+**		}
+**		return (dots > total - num);
+**	}
+*/
+
+/*
+** function that try to optimize the speed
+** FIRST ATTEMPT
+** by verifying if the place left is enough to place at least
+** one of each tetri left
+** TOTAL FAILURE :p
+**
+**	int		check_others(unsigned int *map, t_fillist *list, int size, int num)
+**	{
+**		t_fillist	*tmp;
+**	
+**		// verifie que les tetri restant puissent un par un se placer sur la map
+**		// ca n'optimise qu'en fin de map donc ca ralentit les grosses map en fait
+**		while ((tmp = tmp->next))
+**			if (!find_place(map, tmp, size, 0))
+**				return (0);
+**		return (1);
+**	}
+*/
+
+/*
+** function that look if a tretri fit in a place
+*/
+
+unsigned int	fit_in_place(unsigned int *map, t_fillist *lst, int size, int i)
+{
+	unsigned int	tmp;
+	unsigned int	mask;
+	unsigned int	tetri;
+	int				n;
+	int				r;
+
+	n = lst->num;
+	r = lst->rank;
+	i = lst->height;
+	tetri = lst->tetribit << 16 >> lst->width;
+	tmp = 0;
+	mask = ~0u << (32 - lst->width);
+	while (i--)
+	{
+		if (tmp & tetri)
+			return (0);
+		if (r >= 32 && ++n)
+			r -= 32;
+		tmp = (mask & (map[n] << r)) | (mask & (map[n + 1] >> (32 - r)));
+		tetri <<= lst->width;
+		r += size;
+	}
+	return (!(tmp & tetri));
+}
+
+/*
+** function that look for the first place in the map for a tetri
+*/
+
+int		find_place(unsigned int *map, t_fillist *list, int size)
+{
+	int	limit;
+	int pos;
+
+	pos = list->position;
+	list->place = pos % size;
+	list->rank = pos % 32;
+	list->num = pos / 32;
+	limit = (size - list->height + 1) * size;
+	while (pos < limit)
+	{
+		if (list->rank >= 32 && ++list->num)
+			list->rank -= 32;
+		if (list->place > size - list->width)
+		{
+			list->place = -1;
+			pos += list->width - 2;
+			list->rank += list->width - 2;
+		}
+		else if (fit_in_place(map, list, size, 0))
+			return ((list->position = pos + 1));
+		pos++;
+		list->place++;
+		list->rank++;
+	}
+	return (0);
+}
+
+/*
+** function that add or remove a tetri on the map
+*/
+
+void	add_remove(unsigned int *map, t_fillist *list, int size)
+{
+	unsigned int	mask;
+	unsigned short	tetri;
+	int				i;
+	int				j;
+
+	tetri = list->tetribit;
+	mask = ~0u << (32 - list->width);
+	i = (list->height - 1) * list->width;
+	j = (list->height - 1) * size + list->position;
+	while (j >= list->position)
+	{
+		map[(j - 1) / 32] ^= (mask & tetri << (16 + i)) >> (j - 1);
+		map[(j - 1) / 32 + 1] ^= (mask & tetri << (16 + i)) << (32 - j) << 1;
+		j -= size;
+		i -= list->width;
+	}
+}
+
+/*
+** Function that recursively try to fill the map with the tetris
+*/
+
+int		fill_map(unsigned int *map, t_fillist *list, int size, t_fillist *link)
+{
+	if (!list)
+		return (1);
+	list->position = 0;
+	while (find_place(map, list, size))
+	{
+		add_remove(map, list, size);
+		
+							list->test = 1;						// DEBUG
+//							print_final_map(link, size, 1);		// DEBUG
+//							ft_putchar('\n');					// DEBUG
+
+		if (check_tetri_memory(list, list->position))
+			if (fill_map(map, list->next, size, link))
+				return (1);
+		add_remove(map, list, size);
+//		remove_tetri_memory(list, list->position);
+
+							list->test = 0;						// DEBUG
+
+	}
+	return (0);
+}
+
+/*
+** function that send to "fill_map" a map of a certain size and increment its size untill it's solved
+*/
+
+int		search_map(t_fillist *list)
+{
+	t_fillist		*tmp;
+	unsigned int	*map;
+	int				size;
+	int				num;
+	int				i;
+
+	/////////////////////////////////////////////////// TEST
+	unsigned int	print;
+	tmp = list;
+	while (tmp)
+	{
+		// imression pour tests
+		check_same_tetri(list, 1);
+		print = tmp->tetribit;
+		print <<= 16;
+		print_map(&print, tmp->width, tmp->height, tmp->letter);
+		if (tmp->same)
+		{
+			print = tmp->same->tetribit;
+			print <<= 16;
+			ft_putstr("same --> ");
+			ft_putchar(tmp->same->letter);
+			ft_putchar('\n');
+		}
+		ft_putchar('\n');
+		tmp = tmp->next;
+	}
+	/////////////////////////////////////////////////// TEST
+
+	size = 2;
+	num = 1;
+	tmp = list;
+	while ((tmp = tmp->next))
+		num++;
+	while (size * size < num * 4)
+		size++;
+	i = 0;
+	while (!i)
+	{
+		ft_putnbrendl(size);
+		num = (size * size) / 32 + 1;
+		if (!(map = (unsigned int *)malloc(sizeof(*map) * num)))
+			return (0);
+		check_same_tetri(list, num);
+		while (num)
+			map[num--] = 0;
+		i = fill_map(map, list, size++, list);
+	}
+	ft_putendl("result in binary :");			// DEBUG (pas dans le main car besoin de map)
+	print_map(map, size - 1, size - 1, '#');	// DEBUG
+	return (--size);
+}

fillit.h

@@ -6,7 +6,7 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/03/01 13:34:46 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/05/20 15:18:43 by hulamy           ###   ########.fr       */
+/*   Updated: 2019/05/24 18:04:17 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -46,7 +46,6 @@
 /*
 **	STRUCTURE
 */
-
 typedef struct			s_fillist
 {
 	unsigned short		tetribit;
@@ -64,23 +63,44 @@ typedef struct			s_fillist
 }						t_fillist;
 
 /*
-**	FUNCTIONS
+**	main.c
 */
+int		main(int argc, char **argv);
+int		*create_dope(char *av);
+int		is_mdp(int ac, char **av);
 
+/*
+**	read_file.c
+*/
 char	*read_file(char *file);
+
+/*
+**	handle_errors.c
+*/
 void	print_error(char *s);
-void	print_error_extended(int error);
-int	    parse_input(char *input, t_fillist **list);
-int		check_file_errors(char *file);
+void	print_error_extended(int error, int *dope);
+int		check_file_errors(char *file, int *dope);
 int		check_tetri_errors(char *tetri);
 int		check_tetri_errors_proxy(char *tetri);
+
+/*
+**	handle_errors.c
+*/
+int	    parse_input(char *input, t_fillist **list, int *dope);
 int		add_to_list(char *square, t_fillist **list, char letter);
 void    fill_list(char line[], t_fillist *list);
+unsigned short	reduce_tetri(unsigned short tetri, int width);
+unsigned short	tab_to_bin(char line[]);
+
 void    print_bits(unsigned int bits, int size); //TO DELETE BEFORE EVAL
 void    print_tetri(unsigned int bits, int size); //TO DELETE BEFORE EVAL
 int		search_map(t_fillist *list);
 void	print_map(unsigned int *tab, int width, int height, char letter);
 void    print_final_map(t_fillist *list, int size, int flag);
 void	ft_put_tetri_color(char c);
+int		check_tetri_memory(t_fillist *list, int pos);
+void	remove_tetri_memory(t_fillist *list, int pos);
+int		check_same_tetri(t_fillist *list, int num);
+int		compare_tetri(t_fillist *tetri_a, t_fillist *tetri_b);
 
 #endif

main.c

@@ -6,35 +6,100 @@
 /*   By: vmanzoni <vmanzoni@student.42.fr>          +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/02/12 13:20:48 by vmanzoni          #+#    #+#             */
-/*   Updated: 2019/05/20 15:51:50 by hulamy           ###   ########.fr       */
+/*   Updated: 2019/05/24 18:02:29 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
 #include "fillit.h"
 
-int		main(int argc, char **argv)
+/*
+** function that put the flags for bonus into a tab of int
+**
+** d : debug print (print the map during the backtracking)
+** o : optimisation ultra fast but with some errors still
+** p : print extended (print the tetri and the map in different formats)
+** e : error extended (error message more precise AND no error for too much tetri)
+*/
+
+int		*create_dope(char *av)
+{
+	char	*comp;
+	int		*dope;
+	int		i;
+	int		j;
+
+	comp = "dope";
+	if (!(dope = (int*)malloc(sizeof(*dope) * 4)))
+		return (NULL);
+	i = 0;
+	while (i < 4)
+		dope[i++] = 0;
+	i = -1;
+	while (++i < 4 && (j = -1))
+		while (av[++j])
+			if (comp[i] == av[j])
+				dope[i] = 1;
+
+	ft_putendl(av);
+	i = -1;
+	while (++i < 4)
+		ft_putnbr(dope[i]);
+	ft_putchar('\n');
+	return (dope);
+}
+
+/*
+** function that check if the password is good to unlock the flags
+*/
+
+int		is_mdp(int ac, char **av)
+{
+	char	*mdp;
+	int		i;
+
+	if (ac != 4)
+		return (0);
+	mdp = "trompette";
+	i = 0;
+	while (av[2][i] && mdp[i] && mdp[i] == av[2][i])
+		i++;
+	if (av[2][i] || mdp[i])
+		return (0);
+	return (1);
+}
+
+/*
+** main function
+*/
+
+int		main(int ac, char **av)
 {
 	t_fillist	*list;
 	char		*input;
+	int			*dope;
 	int			size;
 
 	list = NULL;
-	if (argc == 2)
+	if (ac == 2 || is_mdp(ac, av))
 	{
-		if (!(input = read_file(argv[1])))
-			print_error("error\n");
-//			print_error("error: Could not read file.\n");
-		if (check_file_errors(input))
-			print_error("error\n");
-//			print_error("error: Invalid file.\n");
-//			print_error_extended(check_file_errors(input));
-		size = parse_input(input, &list);
-		ft_putchar('\n');
-		ft_putendl("result for humans :");
+		dope = create_dope(av[3]);
+		if (!(input = read_file(av[1])))
+		{
+			if (dope[3])
+				print_error("error: Could not read file.\n");
+			else
+				print_error("error\n");
+		}
+		check_file_errors(input, dope);
+		size = parse_input(input, &list, dope);
+
+		ft_putchar('\n');						// DEBUG
+		ft_putendl("result for humans :");		// DEBUG
 		print_final_map(list, size, 1);			// DEBUG
-		ft_putchar('\n');
-		ft_putendl("result for moulinette :");
-		print_final_map(list, size, 0);			// DEBUG
+		ft_putchar('\n');						// DEBUG
+		ft_putendl("result for moulinette :");	// DEBUG
+
+		print_final_map(list, size, 0);
 	}
 	else
 		print_error("usage: Please submit a file.\n> ./fillit file.fillit\n");

samples/debug/jdugoudr1

@@ -0,0 +1,84 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr10

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr11

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr12

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr13

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr14

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr15

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr16

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr17

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....

samples/debug/jdugoudr18

@@ -0,0 +1,79 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#

samples/debug/jdugoudr18_17

@@ -0,0 +1,79 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#

samples/debug/jdugoudr18_17_16

@@ -0,0 +1,74 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....

samples/debug/jdugoudr18_17_16_15

@@ -0,0 +1,69 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....

samples/debug/jdugoudr18_17_16_15_14

@@ -0,0 +1,64 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....

samples/debug/jdugoudr18_17_16_15_14_13

@@ -0,0 +1,59 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr18_17_16_15_14_13_12

@@ -0,0 +1,54 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....

samples/debug/jdugoudr18_17_16_15_14_13_12_11

@@ -0,0 +1,49 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#

samples/debug/jdugoudr18_17_16_15_14_13_12_11_10

@@ -0,0 +1,44 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_10

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_11

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_12

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_13

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_14

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_15

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_16

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_17

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_18

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....

samples/debug/jdugoudr1_2

@@ -0,0 +1,79 @@
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3

@@ -0,0 +1,74 @@
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4

@@ -0,0 +1,69 @@
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4_5

@@ -0,0 +1,64 @@
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4_5_6

@@ -0,0 +1,59 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4_5_6_7

@@ -0,0 +1,54 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4_5_6_7_8

@@ -0,0 +1,49 @@
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4_5_6_7_8_9

@@ -0,0 +1,44 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_2_3_4_5_6_7_8_9_10

@@ -0,0 +1,39 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_3

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_4

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_5

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_6

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_7

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_8

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr1_9

@@ -0,0 +1,79 @@
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr2

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr3

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr4

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr5

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr6

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr7

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr8

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+....
+###.
+#...
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

samples/debug/jdugoudr9

@@ -0,0 +1,84 @@
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....
+
+####
+....
+....
+....
+
+.##.
+##..
+....
+....
+
+##..
+.##.
+....
+....
+
+...#
+...#
+...#
+...#
+
+#...
+##..
+.#..
+....
+
+....
+###.
+#...
+....

test_search_map2.c

@@ -6,7 +6,7 @@
 /*   By: hulamy <hulamy@student.42.fr>              +#+  +:+       +#+        */
 /*                                                +#+#+#+#+#+   +#+           */
 /*   Created: 2019/04/27 20:47:22 by hulamy            #+#    #+#             */
-/*   Updated: 2019/05/21 15:27:37 by hulamy           ###   ########.fr       */
+/*   Updated: 2019/05/24 14:41:08 by hulamy           ###   ########.fr       */
 /*                                                                            */
 /* ************************************************************************** */
 
@@ -215,18 +215,15 @@ int		check_tetri_memory(t_fillist *list, int pos)
 
 	tetri = list;
 	mask = 1 << ((pos % 32) - 1);
-	if (tetri->same != NULL)
+	if (tetri->same)
 	{
 		if (!(tetri->same->memory[pos / 32] & mask))
-		{
-			tetri->same->memory[pos / 32] |= mask;
-			return (1);
-		}
+			return (tetri->same->memory[pos / 32] |= mask);
 	}
 	else
 	{
-		tetri->memory[pos / 32] |= mask;
-		return (1);
+//		if (!(tetri->memory[pos / 32] & mask))
+			return (tetri->memory[pos / 32] |= mask);
 	}
 	return (0);
 }
@@ -239,16 +236,22 @@ void	remove_tetri_memory(t_fillist *list, int pos)
 	tetri = list;
 	mask = 1 << ((pos % 32) - 1);
 	if (tetri->same != NULL)
-		tetri->same->memory[pos / 32] ^= mask;
+	{
+		if ((tetri->same->memory[pos / 32] & mask))
+			tetri->same->memory[pos / 32] ^= mask;
+	}
 	else
-		tetri->memory[pos / 32] ^= mask;
+	{
+		if ((tetri->memory[pos / 32] & mask))
+			tetri->memory[pos / 32] ^= mask;
+	}
 }
 
 /*
 ** Function that recursively try to fill the map with the tetris
 */
 
-int		fill_map(unsigned int *map, t_fillist *list, int size)
+int		fill_map(unsigned int *map, t_fillist *list, int size, t_fillist *link)
 {
 	if (!list)
 		return (1);
@@ -256,11 +259,19 @@ int		fill_map(unsigned int *map, t_fillist *list, int size)
 	while (find_place(map, list, size))
 	{
 		add_remove(map, list, size);
-		if (check_tetri_memory(list, list->position))
-			if (fill_map(map, list->next, size))
+		
+							list->test = 1;						// DEBUG
+//							print_final_map(link, size, 1);		// DEBUG
+//							ft_putchar('\n');					// DEBUG
+
+//		if (check_tetri_memory(list, list->position))
+			if (fill_map(map, list->next, size, link))
 				return (1);
 		add_remove(map, list, size);
 //		remove_tetri_memory(list, list->position);
+
+							list->test = 0;						// DEBUG
+
 	}
 	return (0);
 }
@@ -329,9 +340,18 @@ int		search_map(t_fillist *list)
 	while (tmp)
 	{
 		// imression pour tests
+		check_same_tetri(list, 1);
 		print = tmp->tetribit;
 		print <<= 16;
 		print_map(&print, tmp->width, tmp->height, tmp->letter);
+		if (tmp->same)
+		{
+			print = tmp->same->tetribit;
+			print <<= 16;
+			ft_putstr("same --> ");
+			ft_putchar(tmp->same->letter);
+			ft_putchar('\n');
+		}
 		ft_putchar('\n');
 		tmp = tmp->next;
 	}
@@ -347,15 +367,16 @@ int		search_map(t_fillist *list)
 	i = 0;
 	while (!i)
 	{
+		ft_putnbrendl(size);
 		num = (size * size) / 32 + 1;
 		if (!(map = (unsigned int *)malloc(sizeof(*map) * num)))
 			return (0);
 		check_same_tetri(list, num);
 		while (num)
 			map[num--] = 0;
-		i = fill_map(map, list, size++);
+		i = fill_map(map, list, size++, list);
 	}
-	ft_putendl("result in binary :");
+	ft_putendl("result in binary :");			// DEBUG (pas dans le main car besoin de map)
 	print_map(map, size - 1, size - 1, '#');	// DEBUG
 	return (--size);
 }