JESS: N-Queens

Dear all,

I am trying to solve the N-Queens problem using Jess. Is there a way to use rules to make a efficient program, or I have to use functions to do the brute force search?

I am trying to compare several systems to see which one is good at this N-Queens problem.

Thanks,
Senlin