Progress report for week 49

The report is comming along nicely. It is currently undergoing revision and is expected to be done by the deadline the 20. December.

Inspired by a comment by Hein Meling I put together some notes on how the Dancing Links algorithm could be made non-recursive (read: neither recursive nor iterative). It was more of a side comment from his side, but I’m prone to fall for nerd sniping so this is nothing new.

The BOINC server for the project is now available for the public. It’s not really production ready yet, but take a look if you’re interested.

NOTE: This post has been imported from my old it’s learning ePortfolio DECS blog.

Advertisements

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s

%d bloggers like this: