Inspiration
This project was proposed at Datathon 2022 by Qualcomm.
What it does
It computes the minimum average manhattan distance that it takes to connect a chain of points using a total of 16 (or less) driverpins.
How we built it
We built it in C++ using different algorithms and techniques such as:
- Clustering methods
- Quicksearch
- Square-root decomposition (Mo's algorithm)
To check our answers we also used Python in order to visualize the points and connections and how to improve them.
Challenges we ran into
We ran into some challenges like finding an efficient code that found the best possible answer under the given constraints.
Accomplishments that we're proud of
We are proud of our result and the effort that we have put into this project.
What we learned
We learned many things related to data science and how to handle real-world problems and come up with a good solution for them in a short amount of time.
Log in or sign up for Devpost to join the conversation.