Your web browser is out of date. Update your browser for more security, speed and the best experience on this site.
Google Hashcode 2021 – Brute force
February 25, 2021, a day that numerous Axxes employers have been looking forward to for quite some time. The annual Google HashCode took place again and during this 4-hour programming contest, developers can prove themselves by achieving the highest possible score on an assignment consisting of an NP-complete problem (simply explained: a problem where an optimal solution is not possible without using brute-force, at a large input).
This year, like for many other events, was a little different. Normally, all participating Axxes people meet at the headquarters in Antwerp, but due to the Corona measures, everyone worked from their home offices. Unfortunately, this meant that there was a little less interaction with the other colleagues. It also made it a bit harder to work together towards a solution, but fortunately there are plenty of tools available to do remote mob-development (e.g. the Code With Me plug-in for JetBrains IDE). We also noticed that Corona didn't hold back the Axxes'ers: there were a whopping 9 Axxes teams represented!
After the introductory video, the teams divided into breakout rooms to begin the assignment. As every year, the assignment was based on a real-life situation. As input, they were given a list was of a number of cars that were each going to follow a certain route, and a number of intersections where multiple streets met. Participants were asked to control the traffic lights at the intersections so that as many cars as possible would get to their final destination within a certain timeframe.
It turned into an exciting, 4-hour battle between the different teams. Thanks to a real-time scoreboard you could always keep track of where you ranked (within the Axxes hub, by country or worldwide). The key to a good solution is to put together an MVP (minimum viable product) as soon as possible and then optimize the algorithm (by using heuristics, thinking logically, and especially contributing with several different solutions).
From this year onwards, however, there was also something extra to win in addition to the honor: the one and only Axxes HashCode Challenge Cup. In the end team DUBBEL TWIEJE ACHT NUL walked away with the prize. Congratulations! Also an honorable mention for the team of trainees (Trainees coding like bees) who achieved a nice second place. The future of Axxes is thus already assured! Team Snake made it into the Axxes top three. But the most important thing is of course that all teams had a good time (and got a free pizza delivered to their homes).
We are looking forward to next year!
