Langford Strings

I solved this week’s hard problem on /r/DailyProgrammer. The relevant /r/DailyProgrammer post explains the problem.

My GitHub has my solution to the problem.

The problem can be generalized to the problem of finding exact covers. In a future post, I will write about exact covers and Knuth’s Algorithm X for finding every exact cover for a given set.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

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