Ibuildings has officially wrapped up their “Elephpant Challenge” contest they were holding to solve a routing problem that involved a globe-trotting PHP ElePHPant. Their latest post (from Ivo Jansch) reveals the results.
Contestants had to write a script that calculated the shortest route for the Elephpant. The contest has several side goals: entries were not not only validated against the given landmarks and a second secret set of landmarks, they also were scored based on their performance, code complexity and code size.
The shorted route, found using the Haversine Formula, involved stops in Mexico City, Cupertino, Hawaii and the Tower of Pisa. The winner for the Medium category was Andy Thompson with an average of 10 landmarks with 38 lines of code (in 333 seconds). The winner in the Senior category was Michiel Brandenburg with coming out on top with a runtime of 50 seconds in 46 lines of code.
The post also includes some interesting observations they found about the event including contestants’ general adherence to the specs, how the choices the developers made really made a difference in the outcome and how difficult running a contest like this could really be. Congrats to the winners!