From: jlee@cse.cuhk.edu.hk
Derrek Wood wrote:
>> > coincidentally, CPSC 312 in UBC just had an assignment in October that
>> > solved Sudoku's... using only Prolog.
>>
>> > hmm...
>> Sudoku can be solved even using generate-and-test, but this will just take
>> forever. Of course, Prolog can be used to solve Sudoku, but a
>> constraint-based solution will be much more efficient. Being at UBC, you
>> have the privilege of learning constraint programming from the Father of
>> Constraints.
>>
>> jim
>>
> Oh I wouldn't suggest using generate-and-test for anything more than a
> simple Sudoku... tends to rather quickly purge your system of its
> usefulness. You can however specify quite a bit of simple logical proofs
> that will help to constrain the end problem. Making some useful
> optimizations along the way would help as well.
> Sudoku at it's heart is very much a simple logical problem. The only reason
> it's of interest to us is the fact that we, as humans, really are not that
> good at logic.
Sure, Sudoku, as with many other puzzles, is a simple logical problem. I
recommend you to read good book by Krzystof Apt
Principles of Constraint Programming, Cambridge University Press,
2003
in which Apt explains constraint solving using proof rules. So constraint
solving is as logical as one can get.
In fact, constraint logic programming CLP is an direct extension of logic
programming LP (a la Prolog) to make LP more expressive and efficient.
Since you are so interested in Prolog, C(L)P should interest you too! Have
fun.
Cheers,
jim
[ comp.ai is moderated. To submit, just post and be patient, or if ]
[ that fails mail your article to , and ]
[ ask your news administrator to fix the problems with your system. ]
--- SoupGate-Win32 v1.05
* Origin: you cannot sedate... all the things you hate (1:229/2)
|
