Article View: net.lang.prolog
Article #730Re: How should I do this?
From: windes
Date: Wed, 06 Aug 1986 23:42
Date: Wed, 06 Aug 1986 23:42
16 lines
1189 bytes
1189 bytes
Well, I have a couple of suggestions:
- First, I don't think your 'linked' procedure is doing what it
should. Seems to me that the query 'linked(state(1,1,1,1),X).' should
produce four distinct alternatives.
- Second, you need to rewrite your 'path' procedure because
A) it is left-recursive, and B) you need to keep a record of states already
visited, and exclude them from the possible next states.
hope this helps.
Ed Windes * UofI ...ihnp4!uiucdcs!uicsl!uicsg!windes - until 8/14/86
* AT&T ...ihnp4!ihopa!edw - after 8/14/86
(HELP, I'm being help in a closet and forced to learn prolog!)
Technical Details
Message-ID:
<3500003@uicsg>Path:
arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!cbosgd!ihnp4!inuxc!pur-ee!uiucdcs!uicsl!uicsg!windesReferences:
<276@mit-amt.MIT.EDU>Show Full Headers
Complete Article Headers
Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbatt!cbosgd!ihnp4!inuxc!pur-ee!uiucdcs!uicsl!uicsg!windes From: windes@uicsg.UUCP Newsgroups: net.lang.prolog Subject: Re: How should I do this? Message-ID: <3500003@uicsg> Date: Wed, 6-Aug-86 19:42:00 EDT Article-I.D.: uicsg.3500003 Posted: Wed Aug 6 19:42:00 1986 Date-Received: Sat, 9-Aug-86 08:11:22 EDT References: <276@mit-amt.MIT.EDU> Lines: 16 Nf-ID: #R:mit-amt.MIT.EDU:276:uicsg:3500003:000:619 Nf-From: uicsg.UUCP!windes Aug 6 18:42:00 1986