English version
Accueil     À propos     Téléchargement     Ressources     Contactez-nous    

Ce site est rarement mis à jour. Pour les informations les plus récentes, rendez-vous sur le nouveau site OCaml à l'adresse ocaml.org.

Browse thread
Sudoku solver
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: 2005-11-15 (14:41)
From: Christophe Raffalli <christophe.raffalli@u...>
Subject: Re: [Caml-list] Sudoku solver

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