Version française
Home     About     Download     Resources     Contact us    
Browse thread
algorithm question
[ Home ] [ Index: by date | by threads ]
[ Search: ]

[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: -- (:)
From: Michael Wohlwend <micha-1@f...>
Subject: algorithm question

I want to implement the dancing link algorithm as described here:
http://www-cs-faculty.stanford.edu/~knuth/papers/dancing-color.ps.gz

has someone an idea if there is an equally fast way to implent this more 
functional? The method in the paper seems pretty good, just adjusting a the 
linksfields of the structure...

you can solve puzzle problems with this algorithm and shorter (execution time) 
is really better here :-)

thanks
 Michael