Prolog Knight's Tour



I am after an efficient Prolog implementation of an N * N Knight's
Tour, ideally using Warnsdorff's heuristic. Can anyone point me in the
right direction?

Ta.

.



Relevant Pages