Path Finding using Rapidly-Exploring Random Tree (via @chlalanne) -- "A Rapidly-exploring random tree (RRT) is a data structure and algorithm designed for efficiently searching nonconvex, high-dimensional search spaces. The tree is constructed in such a way that any sample in the space is added by connecting it to the closest sample already in the tree."
JVM? Top 4: Scala 74.8% Clojure 46.2% Groovy 28.9 JRuby 25.5% Take the survey (via @pageman) -- Take the survey, it's very short. At the time of writing this Clojure was at 39%, Groovy at 45% and Scala at 62%.