From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: X-Original-To: caml-list@yquem.inria.fr Delivered-To: caml-list@yquem.inria.fr Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by yquem.inria.fr (Postfix) with ESMTP id 13E6CBB9C for ; Tue, 15 Nov 2005 15:41:04 +0100 (CET) Received: from pauillac.inria.fr (pauillac.inria.fr [128.93.11.35]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id jAFEf3kH010889 for ; Tue, 15 Nov 2005 15:41:03 +0100 Received: from nez-perce.inria.fr (nez-perce.inria.fr [192.93.2.78]) by pauillac.inria.fr (8.7.6/8.7.3) with ESMTP id PAA23565 for ; Tue, 15 Nov 2005 15:41:03 +0100 (MET) Received: from net.univ-savoie.fr (net.univ-savoie.fr [193.48.120.75]) by nez-perce.inria.fr (8.13.0/8.13.0) with ESMTP id jAFEf2VZ010884 (version=TLSv1/SSLv3 cipher=EDH-RSA-DES-CBC3-SHA bits=168 verify=NO) for ; Tue, 15 Nov 2005 15:41:03 +0100 Received: from post.bourget.univ-savoie.fr (post.bourget.univ-savoie.fr [193.48.120.73]) by net.univ-savoie.fr (8.12.3/jtpda-5.4) with ESMTP id jAFEf0ER006032 for ; Tue, 15 Nov 2005 15:41:00 +0100 Received: from [193.48.123.45] (d45.lama.univ-savoie.fr [193.48.123.45]) by post.bourget.univ-savoie.fr (8.12.3/jtpda-5.4) with ESMTP id jAFEeucc029002 ; Tue, 15 Nov 2005 15:40:56 +0100 Message-ID: <4379F37C.2010408@univ-savoie.fr> Date: Tue, 15 Nov 2005 15:41:00 +0100 From: Christophe Raffalli User-Agent: Mozilla Thunderbird 1.0.6 (X11/20050716) X-Accept-Language: fr, en MIME-Version: 1.0 To: caml-list Subject: Re: [Caml-list] Sudoku solver References: <4379DAEF.7060108@recherche.enac.fr> In-Reply-To: <4379DAEF.7060108@recherche.enac.fr> Content-Type: text/plain; charset=ISO-8859-1; format=flowed Content-Transfer-Encoding: 8bit X-Scanned-By: MIMEDefang 2.33 (www . roaringpenguin . com / mimedefang) X-Miltered: at nez-perce with ID 4379F37F.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Miltered: at nez-perce with ID 4379F37E.000 by Joe's j-chkmail (http://j-chkmail.ensmp.fr)! X-Spam: no; 0.00; christophe:01 raffalli:01 christophe:01 raffalli:01 univ-savoie:01 caml-list:01 solver:01 chablais:01 73376:01 univ-savoie:01 lama:01 mutt:01 universite:03 cedex:03 notion:04 X-Spam-Checker-Version: SpamAssassin 3.0.3 (2005-04-27) on yquem.inria.fr X-Spam-Level: X-Spam-Status: No, score=0.0 required=5.0 tests=none autolearn=disabled version=3.0.3 And what about a sudoko generator with a pertinent notion of level for a human ? Would be nice if you could choose the cases that are filled from start ... a start for level for problems with a unique solution : - negative level -n : number of times where you have to do deep reasonning (guesses) because you do not have an immediate choice. - positive level n : minimum of the number of cases that can be filled by an immediate choice on all branch ? These are not formal definition ... yet, but using a representation of the problem as a set of close, I think we can do something with the complexity of the proof search ... just for fun ... -- Christophe Raffalli Université de Savoie Batiment Le Chablais, bureau 21 73376 Le Bourget-du-Lac Cedex tél: (33) 4 79 75 81 03 fax: (33) 4 79 75 87 42 mail: Christophe.Raffalli@univ-savoie.fr www: http://www.lama.univ-savoie.fr/~RAFFALLI --------------------------------------------- IMPORTANT: this mail is signed using PGP/MIME At least Enigmail/Mozilla, mutt or evolution can check this signature. The public key is stored on www.keyserver.net ---------------------------------------------