Show HN: 10-minute programming challenge. Let's do more of these.
missstep.com
missstep.com
-- Sudoku verifier
-- library generator (scan all of the music files on your drive and compile a list of artists)
-- dictionary app (using Wordnik API)
-- flexible calculator that can detect postfix v. prefix
-- Sudoku solver
-- Hidato solver (which is essentially King's tour, but cooler)
-- tumblr API wrapper (or really any OAuth service)
-- n-gram language classifier
I just put in a 2.4km address and it came out to ~2,500 steps.
See this permalink (click "go")
http://missstep.com/?origin=Clayallee%209%2014191%20Berlin,%...
"The fastest route is 2,4 km, which will take approximately 24,855 to 33,140 steps if you walked it."
The 15 minutes concept would probably make good katas to keep stuff you have already used up to date in your memory. Would love to see a collection of small challenges like this grouped under different kinds of tags. This one might be javascript, google-maps for instance.
I would use that.
Such a shame that Google started limiting and charging for their APIs :(
I think Google's limits are per IP address, so doing the lookups client-side should keep my app working for any reasonable amount of use.
Woo!
Finding & registering the domain was part of the 15 minutes. As was setting up (and propagating) the DNS.
So the problem is the copy I wrote. I'll leave it be since my 10-minute limit is over. But I agree I should've said "The shortest walk is x miles..."
Or you could analyse ground gradiants for steepness and find the flatest. Combine with your own personal fitness levels and solve for a better optimal route :)
Traffic lights, crime-addled regions, embassies (I wouldn't dare jog towards a guarded embassy carrying a backpack), loose gravel paths. All these will slow down walking considerably.
Or outside the city: Marshes, mountains, thick forests, muddy hill slopes.
Same with your car: the places without roads are undrivable and therefore not available for routing. But with a car, the speeds are so much greater than bipedal motion, shortest vs. fastest is a viable question. When the routing system avoids obstacles, it's mostly going give you the shortest and fastest route. brador makes a good point about grade; with enough grade on the shortest route, it might not be the fastest.
It's a quick and dirty calculation that google is making about routing. Im pretty sure the google walking routes wont take you through marshes or thick forests.