Please, do as you will with my code! It's free for all to play with. TBH, I'm delighted that someone else can find use for it. I'd love to see what improvements you could make.
I've also now posted up on the wiki page some plots of the performance using Incanter http://wiki.github.com/phraemer/Boggle-Solver I tested this against a friends very neat (but not optimised) c++ implimentation and it's only slightly faster as far as I can tell. I suspect that some clever people on here could easily get better performance out of my version and yet keep it idiomatic. (Come on you guys and gals ;)) What I do love is that it would be trivial to parallelise this in Clojure with no risk of locking, but still the most interesting thing right now is tackling the single threaded performance. On Nov 10, 10:53 am, william douglas <william.r.doug...@gmail.com> wrote: > Very nice, I had actually been implementing a boggle solver for my > optimal boggle grid generator (5x5 with no limits on number of letters > on dice). I hadn't discovered the wonders of assoc-in though which > makes things look much nicer when creating nested maps. I really like > the layout of your code in general too though I'm a beginner with > clojure myself. > > Mind if I fork your solution into mine for the grid creation as your > solver has very nice performance? > > -William -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
