By mswatcher
via slowfrog.blogspot.in
Published: Feb 12 2012 / 10:49
After my first try using brute force search to solve the Hexiom puzzler, and following recommandations I received in comments, I switched to an approach using constraint solving principles. It's not yet finished (I can still think of new constraints to add), but it's already working more or less as efficiently as the search version. I will try to highlight my findings in this post.
-
Javascript URL Object
-
Building a full-text index of git commits using lunr.js and Github APIs
-
How Strategy Pattern help in reducing code duplication, avoid type casting and make design Better
-
How To Setup php-fpm And Nginx On CentOS 6
-
Following up on the Design Guidance for Windows Store Apps
-
RavenDB & the magic beans by Ayende Rahien (Podcast)
Add your comment
