Inspiration
We all travel and it can be annoying to arrive at your gate and try to find seating and probably see that all the seats are taken. Our team decided that this problem was the last thing needed on top of the preexisting stress from traveling.
What it does
Our project will take the number of travelers and gate and find the optimal seats for them. It will first try to seat the parties together and if that option is not available, it will split the group according to the availability while placing them closest to the gate.
How we built it
Our project uses Python
Challenges we ran into
The main challenge we ran into was not being able to properly split a group of three if there were not three seats available together. Eventually, we modified our code and figured out the problem.
Accomplishments that we're proud of
We were proud that we were able to efficiently find the optimal seating arrangement for a party of three.
What we learned
We learned that we need to use function calls efficiently next time.
What's next for GateKeep
Next, we will try to expand the number of groups numbers to 4,5, and so on. We will also find the next available gate if the current gate is full.
Log in or sign up for Devpost to join the conversation.