I am testing several systems including Jess. I programmed it in Yap in a
similar procedural way, since there is no easy way to implement it in prolog
back-tracking systems, while this problem can be solved easily by constraint
programming systems like DLV.
I know the above procedural program is ba
On May 9, 2008, at 10:13 AM, Senlin Liang wrote:
I tried the brute force procedure search with a maximal depth limit,
it is really slow. while in other systems (like yap)it much faster.
There's no earthly reason why you'd write a big procedural program
like this in Jess; that's just not w
I tried the brute force procedure search with a maximal depth limit, it is
really slow. while in other systems (like yap)it much faster.
In yap, I defined
move(x,y) :- up(x,y).
move(x,y) :- down(x,y).
move(x,y) :- right(x,y).
move(x,y) :- left(x,y).
and keep all the seen state in a list to avoid i
On Thu, May 8, 2008 at 8:30 PM, <[EMAIL PROTECTED]> wrote:
> It's probably one of those things that
> would be easier to do procedurally, since brute forcing seems to be
> relatively straight forward.
>
Yes, although it might be slow without heuristics, i.e., some good strategy
according to what
cc
sandia.gov
Subject
Re: JESS: Puzzle 15
05/08/2008 01:17
I have never seen a program for this one in any language. Have you, or
anybody else?
-W
On Thu, May 8, 2008 at 2:39 PM, Senlin Liang <[EMAIL PROTECTED]> wrote:
> Dear all,
>
> I am trying to solve the puzzle 15 problem using jess, but failed to find
> a good solution. Is anyone has a ready progra
Dear all,
I am trying to solve the puzzle 15 problem using jess, but failed to find a
good solution. Is anyone has a ready program for it?
Thanks,
Senlin
