Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!philabs!cmcl2!harvard!caip!ut-sally!utah-cs!u-reddy
From: u-reddy@utah-cs.UUCP (Uday U-reddy)
Newsgroups: net.lang.prolog
Subject: Re: PROLOG Digest   V4 #22
Message-ID: <3831@utah-cs.UUCP>
Date: Tue, 24-Jun-86 22:16:17 EDT
Article-I.D.: utah-cs.3831
Posted: Tue Jun 24 22:16:17 1986
Date-Received: Fri, 27-Jun-86 04:06:22 EDT
References: <8606180752.AA07915@ucbvax.Berkeley.EDU> <1389@pucc-j>
Reply-To: u-reddy@utah-cs.UUCP (Uday U-reddy)
Organization: University of Utah CS Dept
Lines: 10
Keywords: eight queens

In article <1389@pucc-j> rsk@pucc-j.UUCP (Wombat) writes:
>Here is another solution to the eight queens problem; I found this one
>easier to understand, though others may differ on that point.  It was
>written by Malcolm Slaney while he was at Purdue University; he is
>reachable at pur-ee!malcolm.
>Rich Kulawiec, pucc-j!rsk, rsk@j.cc.purdue.edu

I think Vijay's point was to give a "concurrent" prolog program for
N queens in which (debatably logical) variables are used in an interesting
way.