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.