Walkovers & ties

Hang runners off the edge of the lattice using extreme abilities (large magnitude or -Infinity / +Infinity). The ClusterSplitter takes over: it groups runners around the largest gap, computes group-representative winning densities, and recurses on the weaker side. See how walkovers (one runner takes all) and equal-share behaviour (indistinguishable favourites) emerge naturally.

Try the buttons:

• Walkover: one runner is well inside the lattice while everyone else is far away. That runner takes nearly all the probability.
• Tied favourites: several runners at identical ability with everyone else hopeless. They split the win mass equally.
• Outliers: two clusters at large distance. The splitter handles the gap by treating each cluster as a single representative for the cross-group race.