The first of this series covered our general aims how we’d be structuring the project. This post will cover how we get the data into RavenDB. First we need to download the data. I got it obtained the data from this site, you need to click the “téléchanger la base” link under “Coordonnées géographiques des villes Françaises” here is the direct link. It’s not the best data source in the world, but it’s the best freely available one that I’ve found. Once you’ve unzipped the zip and converted it CSV the loadi[...]

So Stack Overflow Dev Days has been cancelled. Obviously it’s a big disappointment to everyone involved, I thought the line up for the London event was great and I was looking forward to attending the conference as much as I was looking forward to speaking at it. If it’s any compensation you can see me do this talk at skill matter as one of their in the brain sessions: The Combinator Approach to Programming Domain Specific Languages with F# Using a “combinator” approach to create internal Domain Specifi[...]

Problem Peter has nine four-sided (pyramidal) dice, each with faces numbered 1, 2, 3, 4. Colin has six six-sided (cubic) dice, each with faces numbered 1, 2, 3, 4, 5, 6. Peter and Colin roll their dice and compare totals: the highest total wins. The result is a draw if the totals are equal. What [...]

Problem By counting carefully it can be seen that a rectangular grid measuring 3 by 2 contains eighteen rectangles: Although there exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution. Solution This problem looks more difficult than it is, I’m not going to go [...]

Problem In the 5 by 5 matrix below, the minimal path sum from the top left to the bottom right, by only moving to the right and down, is indicated in bold red and is equal to 2427. Find the minimal path sum, in matrix.txt (right click and ‘Save Link/Target As…’), a 31K text file [...]