about us.

graphletics

We are a group of Oxford Computer Science undergraduates and this is our entry for the Group Design Practical: our site Graphletics. We've designed six graph based minigames with the aim of assessing the “technical talent” of players. We hope they are fun to play (and educational!) and attract as many users as possible. We believe that these games can detect students with valuable skills such as: learning and applying new concepts quickly, abstract thinking, concentration and attention to detail.

Bruno Edwards, Hugo Berg, Liam Sawyer, Marcelina Marjankowska, Toby Loader

the challenge.

graphletics

Welcome to Graphletics! Do you want to test the speed of your thinking? Your ability to adjust to problems quickly? Or just have fun with some graph games? If you answered yes to at least one of these questions, this challenge is for you!

Have fun with the graph games, challenge yourself, and see how far you can get!

the games.

graphletics

The minigames consist of:

• 3 practice games - you can play these as much as you wish. Logging in is not necessary. (unless you want your results to be recorded)
• 3 tournament games - you won’t know the content until you participate. If the first time you unlock them, you perform well, we might have a special suprise for you!

glossary.

graphletics

• Vertex: an endpoint/circle in a graph. Note: also known as a node.
• Edge: a line connecting two vertices (circles).
• Isomorphic: a graph can look different when drawn in different ways. We say two graphs are equivalent (“isomorphic”) when we can move the nodes of one (with the edges still connected in the same way) to obtain the other.