Small games built from the things I study and teach.
Untangle the network
Drag the nodes until no two links cross. Every puzzle is solvable. Planar graphs, which can be drawn without crossings, are a classic topic in network science, and untangling them by hand is surprisingly satisfying.
Who trusts it most?
Ten questions from the CHIP50 Trust Tracker. For each institution or public figure, pick the group that trusted it the most in 2026, then see how you rate as a trust expert.
Layout playground
The same network can tell very different stories depending on how you draw it. This is the core lesson of my network visualization tutorial. Click a layout to rearrange the nodes, and see the R code that would produce it.
Find the central Sherlock
Every node in this network is my dog, Sherlock. Arrows show who follows whom. For each question, click the Sherlock with the highest in-degree, out-degree, or betweenness: three of the centrality measures we use to find the most important people in a social network. Drag the heads around if the arrows get tangled.