N-Queens Benchmark

Hello,

I have made a n-queens benchmark for programmable calculators and
pocket computers in different languages can
be found here: http://www.hpmuseum.org/cgi-sys/cgiwrap/hpmuseum/articles.cgi?read=700

There is a pocket computer from casio with a prolog interpreter I have
tested already with a reverse list pogram
at the end of the link above. Is it possible to write a prolog program
that goes a similar way of solving n-queens
like the other languages to be comparable in the benchmark?

Thanks

.