Our logo shows a solution to the famous eight queens problem:Your task: how does that work?
How do you place eight queens on a chessboard so that none can capture any other?
To arrive at this solution you can compute (28 - 1) / (8 - 1) which equals 255 / 7 which equals (rounded to 6 decimals) 36.428571
The eight digits making up that number are the numbers of the rows in which to place 8 successive queens.
eight queens boggler
As described elsewhere, I've quit LiveJournal. If you're interested in my continuing posts, you should look at one of these (each contains feed…
They published a paper on Dremel, my favorite previously-unpublished tool from the Google toolchest. Greg Linden discusses it: "[...] it is capable…
I finally wrote up my recent adventures in treemapping, complete with nifty clickable visualizations.