Bayesian inference of the climbing grade scale
Alexei Drummond, Alex Popinga

TL;DR
This paper applies Bayesian inference and Markov chain Monte Carlo methods to estimate the climbing grade scale, revealing it as a logarithmic measure of difficulty consistent across various grading systems.
Contribution
It introduces a rigorous statistical approach to quantify climbing difficulty scales and estimates the fundamental scale parameter linking different grading systems to difficulty.
Findings
Climbing grade scales are logarithmic in difficulty.
Increment in Ewbank, French, and UIAA grades corresponds to about 2.1 times difficulty increase.
V-grade scale for bouldering corresponds to a 3.17 times difficulty increase.
Abstract
Climbing grades are used to classify a climbing route based on its perceived difficulty, and have come to play a central role in the sport of rock climbing. Recently, the first statistically rigorous method for estimating climbing grades from whole-history ascent data was described, based on the dynamic Bradley-Terry model for games between players of time-varying ability. In this paper, we implement inference under the whole-history rating model using Markov chain Monte Carlo and apply the method to a curated data set made up of climbers who climb regularly. We use these data to get an estimate of the model's fundamental scale parameter m, which defines the proportional increase in difficulty associated with an increment of grade. We show that the data conform to assumptions that the climbing grade scale is a logarithmic scale of difficulty, like decibels or stellar magnitude. We…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSport Psychology and Performance · Sports Performance and Training
