Inspiration
Playing chess can be demoralizing, so we wanted to give chess players and ego boost by showing that they have technically beaten some of the world's top players!
What it does
Transitive Checkmates is a desktop application that allows you to search for the top players you have beaten by the transitive property. It shows you the highest rated player you have beaten, and what the path was from you to them. It also includes a command line parsing tool to create your own data from PGN files.
How we built it
We built Transitive Checkmates using C++ and QT Creator for the visual interface. We implemented several graph search and shortest path algorithms to find our results.
Challenges we ran into
We had some issues deploying the application through QT creator, so the program must be run through QT creator.
Accomplishments that we're proud of
We are proud that we created a useful interface that clearly presents the data, and that the graph algorithms efficiently process the data.
What we learned
We learned that we should plan the interface earlier, and the front end is just as important as the back end.
What's next for Transitive Checkmates:
We want to improve our visual interface, so it can be more easily be run and distributed, and provide the user more options for displaying data.
Log in or sign up for Devpost to join the conversation.