From d0827310792d5b6abf887246bfdd9e27fef0793b Mon Sep 17 00:00:00 2001
From: SteJuventino95 <stethebest10@hotmail.it>
Date: Mon, 19 Jan 2015 23:58:01 +0100
Subject: [PATCH] Soluzione simile a quella proposta in classe
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

Prof, le posto una soluzione al Sudoku Solver che ha pubblicato lei. è simile, ma vi sono alcune differenze
---
 .../fondamenti/sudoku/sudoku_in_classe.c      | 237 ++++++++++--------
 1 file changed, 131 insertions(+), 106 deletions(-)

diff --git a/didattica/fondamenti/sudoku/sudoku_in_classe.c b/didattica/fondamenti/sudoku/sudoku_in_classe.c
index 35017c4..729274e 100644
--- a/didattica/fondamenti/sudoku/sudoku_in_classe.c
+++ b/didattica/fondamenti/sudoku/sudoku_in_classe.c
@@ -1,134 +1,159 @@
-#include <stdio.h>
-#define ORDINE 2
-#define DIM (ORDINE*ORDINE)
 
-int no_doppioni(int a[DIM])
+#include "stdafx.h"
+#include "Math.h"
+
+#define dim 9
+
+void stampa(int mat[dim][dim])
 {
-    int trovato[DIM];
-    int i;
-    for (i=0;i<DIM;i++)
-        trovato[i]=0;
-
-    for (i=0;i<DIM;i++)
-        if (a[i]!=0)
-            if (trovato[a[i]-1]==1)
-                return 0;
-            else
-                trovato[a[i]-1]=1;
-    return 1;
+	for (size_t i = 0; i < dim; i++)
+	{
+		if (i % (int)sqrt((double)dim) == 0)
+			printf("\n\n\n");
+		for (size_t j = 0; j < dim; j++)
+		{
+			if (j % (int)sqrt((double)dim) == 0)
+				printf("\t");
+			printf("%d\t", mat[i][j]);
+		}
+		printf("\n\n");
+	}
 }
 
-int riga_corretta(int s[DIM][DIM], int riga)
+int colonna_corretta(int mat[dim][dim], int k)
 {
-    int a[DIM];
-    int i;
-    for (i=0;i<DIM;i++)
-        a[i]=s[riga][i];
-    return no_doppioni(a);
+	for (size_t i = 0; i < dim; i++)
+	{
+		for (size_t j = 0; j < dim; j++)
+		{
+			if (mat[i][k] == mat[j][k] && mat[i][k]>0 && j != i)
+				return 0;
+		}
+	}
+	return 1;
 }
 
-int colonna_corretta(int s[DIM][DIM], int colonna)
+int riga_corretta(int mat[dim][dim], int k)
 {
-    int a[DIM];
-    int i;
-    for (i=0;i<DIM;i++)
-        a[i]=s[i][colonna];
-    return no_doppioni(a);
+	for (size_t i = 0; i < dim; i++)
+	{
+		for (size_t j = 0; j < dim; j++)
+		{
+			if (mat[k][i] == mat[k][j] && mat[k][i]>0 && j != i){ return 0; }
+		}
+	}
+	return 1;
 }
 
-int riquadro_corretto(int s[DIM][DIM], int riquadro)
+int individua_quadrotto(int x, int y)
 {
-    int x=(riquadro%ORDINE)*ORDINE;
-    int y=(riquadro/ORDINE)*ORDINE;
-    int i;
-    int a[DIM];
-    for (i=0;i<DIM;i++)
-        a[i]=s[x+(i%ORDINE)][y+(i/ORDINE)];
-    return no_doppioni(a);
+	int n = x / (int)sqrt((double)dim) + ((int)y / (int)sqrt((double)dim))*(int)sqrt((double)dim);
+	return n;
 }
 
-int corretto(int s[DIM][DIM])
+int quadrotto_corretto(int mat[dim][dim], int k)
 {
-    int i;
-    for (i=0;i<DIM;i++)
-    {
-        if (riga_corretta(s,i)==0) return 0;
-        if (colonna_corretta(s,i)==0) return 0;
-        if (riquadro_corretto(s,i)==0) return 0;
-    }
-    return 1;
+	int array[dim], l = 0;
+	for (size_t i = 0; i < dim; i++)
+	{
+		for (size_t j = 0; j < dim; j++)
+		{
+			if (individua_quadrotto(j, i) == k)
+			{
+				array[l] = mat[i][j]; l++;
+			}
+		}
+	}
+
+	for (size_t i = 0; i < dim; i++)
+	{
+		for (size_t j = 0; j < dim; j++)
+		{
+			if (array[i] == array[j] && j != i && array[i] != 0) return 0;
+		}
+	}
+	return 1;
+}
+
+
+int risolto(int mat[dim][dim]){
+	for (size_t i = 0; i < dim; i++)
+	{
+		for (size_t j = 0; j < dim; j++)
+		{
+			if (mat[i][j] == 0)
+				return 0;
+		}
+	}
+	return 1;
 }
 
-int risolvi_sudoku(int s[DIM][DIM])
+int concesso(int mat[dim][dim], int n, int x, int y)
 {
-    int x,y;
-    int i,j;
-    int trovato_vuoto=0;
-
-    if (corretto(s)==0) return 0;
-
-    for (i=0;i<DIM;i++)
-        for (j=0;j<DIM;j++)
-            if (s[i][j]==0)
-                if (trovato_vuoto==0)
-                {
-                    trovato_vuoto=1;
-                    x=i;
-                    y=j;
-                }
-
-    if (trovato_vuoto==0) return 1;
-
-    for (i=1;i<=DIM;i++)
-    {
-        s[x][y]=i;
-        if (risolvi_sudoku(s)!=0) return 1;
-    }
-    s[x][y]=0;
-    return 0;
+	int c = mat[y][x];
+	mat[y][x] = n;
+	if ((riga_corretta(mat, y) == 1) && (colonna_corretta(mat, x) == 1) && quadrotto_corretto(mat, individua_quadrotto(x, y)))
+		return 1;
+	mat[y][x] = c;
+	return 0;
 }
 
+void matCopy(const int m1[dim][dim], int m2[dim][dim]){
+	for (size_t i = 0; i < dim; i++)
+	{
+		for (size_t j = 0; j < dim; j++)
+		{
+			m2[i][j] = m1[i][j];
+		}
+	}
+}
 
-int stampa_sudoku(int s[DIM][DIM])
-{
-    int i,j;
+void risolvi(int mat[dim][dim], int x, int y){
 
-    for (i=0;i<DIM;i++)
-    {
-        for (j=0;j<DIM;j++)
-            printf ("%i\t",s[i][j]);
-        printf ("\n");
-    }
+	int itemMat[dim][dim];
 
-}
+	matCopy(mat, itemMat);
 
-void vuota_sudoku(int s[DIM][DIM])
-{
-    int i,j;
-    for (i=0;i<DIM;i++)
-        for (j=0;j<DIM;j++)
-            s[i][j]=0;
+	if (x >= dim){ x = 0; y++; }
+
+	if (mat[y][x] != 0)return risolvi(mat, x + 1, y);
+
+	else{
+		for (int i = 1; i <= dim && y<dim; i++)
+		{
+			if (risolto(mat) != 1)
+			{
+				matCopy(itemMat, mat);
+				if (concesso(mat, i, x, y) == 1)
+					risolvi(mat, x + 1, y);
+			}
+		}
+	}
 }
 
 
-int main()
+int _tmain(int argc, _TCHAR* argv[])
 {
-/*    int m[DIM][DIM]={{0,1,0,4,0,0,6,0,8},
-                     {0,2,0,9,0,0,0,7,0},
-                     {8,0,0,6,0,0,0,3,0},
-                     {7,0,6,0,0,0,0,1,0},
-                     {0,0,0,1,0,8,0,0,0},
-                     {0,8,0,0,0,0,2,0,5},
-                     {0,4,0,0,0,6,0,0,9},
-                     {0,5,0,0,0,2,0,4,0},
-                     {9,0,7,0,0,3,0,8,0}};*/
-    int m[DIM][DIM] = {{0,0,1,0},
-                       {0,0,0,0},
-                       {0,0,0,0},
-                       {0,0,3,0}};
-
-    /*int m[DIM][DIM];*/
-    /*vuota_sudoku(m);*/
-    risolvi_sudoku(m);
-    stampa_sudoku(m);
+	/*int mat[dim][dim] = {
+	{ 3, 4, 1, 0 },
+	{ 0, 2, 0, 0 },
+	{ 0, 0, 2, 0 },
+	{ 0, 1, 4, 3 } };*/
+
+	int mat[dim][dim] = {
+		{ 0, 0, 7, 9, 6, 2, 4, 0, 0 },
+		{ 9, 0, 0, 0, 1, 0, 0, 0, 2 },
+		{ 0, 1, 0, 8, 5, 3, 0, 6, 0 },
+		{ 5, 0, 0, 4, 7, 9, 0, 0, 1 },
+		{ 0, 0, 0, 0, 8, 0, 0, 0, 0 },
+		{ 4, 0, 0, 3, 2, 1, 0, 0, 7 },
+		{ 0, 9, 0, 2, 4, 8, 0, 5, 0 },
+		{ 6, 0, 0, 0, 3, 0, 0, 0, 8 },
+		{ 0, 0, 8, 6, 9, 5, 1, 0, 0 } };
+
+
+	risolvi(mat, 0, 0);
+	stampa(mat);
+
+	return 0;
 }