The other day, I found a reference to the Add-A-Gram puzzle, which is one of the retired challenges from ITA Software for prospective employees. Today’s challenge is to solve the Add-A-Gram puzzle with Emacs/Elisp. I’ll give a solution next week.
-
Recent Posts
Recent Comments
- borgauf on JSON Versus S-Expressions (Again)
- plgx on Emacs Keybindings for Mac OS X
- Isaac on EmacsMovies Looks at Gnus
- jcs on Org Mode Summary
- Seth Mason on Org Mode Summary
Links
Archives
- May 2013
- April 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- July 2012
- June 2012
- May 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
- September 2011
- August 2011
- July 2011
- June 2011
- May 2011
- April 2011
Categories
Meta
that’s a very interesting challenge, on several levels i think. The algorithm aspect is interesting because one could go all the way by a search tree to ensure longest resulting word. Or, one could use a algorithm that words fastest (such that the ratio of wordlength/time is better than exhaustive search above for n runs.). Exactly where is the balance isn’t known neither until one does some. I think frequency of letter also matters, but possibly also order, letter pair/triad, when one wants the second characteristics.
then, implementation also comes into play. i think good/lousy implementation could differ a lot on speed/memory footprint.
very interesting problem. Thanks for the post.