Time to Dance

09 May 2012

I’ll start by acknowledging the fact that it has been too long since I have updated this blog. I got bored and had no collaborators for the pyFidelity project, so I stopped.

I now have a new project to work on (this time with collaboration). I will not go into too much detail about the project but to say that it can be modeled as an exact cover problem; a set of constraints and a set of partial solutions. For any given constraint, all of the partial solutions are mutually exclusive. The best example of such a problem is a sudoku puzzle. I do not want to spend too much time explaining the problem, so I’ll move on.

I have been enjoying the Go programming language lately, so I want to see if the Dancing Links implementation of Knuth’s Algorithm X described best in his paper [gzipped postscript] can be done nicely in go. Not to avoid due diligence, I conducted a quick search of the go resources and mailing list as well as github repositories. I found only a sudoku solver which roughly implements DLX and several implementations in other languages. So, I started my own project.

As time goes on, I hope to keep this blog updated with the development of this project.