James Cranch

I'm not sure I completely understand the question. Let me guess what you mean. You've got a set of points x_1, ..., x_n in 3D, constrained to lie on a...

It would be possible to add advice on doing that, but I haven't yet seen why that's a natural thing to do. You should be able to implement the algorithm...

What you're trying to do is the so-called "[nearest neighbour algorithm](https://en.wikipedia.org/wiki/Travelling_salesman_problem#Constructive_heuristics)", right? The greedy approximation for the travelling salesman problem?

I think you're right. For ease, the config file should probably be written in Python: it should just set some variables.

I'm keen. Is there a list of Acts of Parliament anywhere? If not, is there anywhere I could scrape one from? :-)

I've got some code for (reasonably) efficiently searching for many, many strings simultaneously; I'm currently testing it out on finding citations to judgments inside other judgments. This may work on...

In order to attempt this, it would be easiest if we had a sqlite .db file containing a table of company names and OpenCorporates URLs. Do you think you could...

I should make it clear I'm now completely confident that we can search through the archive for very large numbers of strings (presumably even in the millions) simultaneously in an...

I should mention - I don't regard this request as necessarily in final form. I'm happy to write tests if desired, and I'm happy to change the nomenclature.