- From: Danny Ayers <danny.ayers@gmail.com>
- Date: Sun, 30 Apr 2006 03:02:34 +0200
- To: "jos.deroo@agfa.com" <jos.deroo@agfa.com>
- Cc: www-archive@w3.org
On 4/30/06, jos.deroo@agfa.com <jos.deroo@agfa.com> wrote: > > euler5 http://eulersharp.sourceforge.net/2006/02swap/euler.yap is > basically > go:- (X==>Y), X, \+Y, step((X==>Y)), assert(Y), go; true. % Euler path > via \+Y to not step in own steps Weeeeee - please slow down..! Could you please explain this in a more verbose fashion ;-) I vaguely remember hitting loops right away on even the simplest relations with prolog (without tabling) - how does Euler know where it's been? Using anything specific to yap? > on yap http://sourceforge.net/projects/yap > it is on average 25 times faster than cwm or euler1,2,3,4 Awesome. Cheers, Danny. -- http://dannyayers.com
Received on Sunday, 30 April 2006 01:02:41 UTC