People · Kazakhstan
Ansar Ospanov (Ансар Оспанов)
3×3 · top 74.4% of 288,433 all-time · competing since March 2019 · 2019OSPA01
Ansar Ospanov (Ансар Оспанов) has been competing for 8 years. His best event is the 3×3: a personal-best single of 37.88, set at KSF Pavlodar City 2019, puts him in the top 74.4% of the 288,433 people who have ever been ranked in the event, and 887th in Kazakhstan. Across 1 competition since March 2019, he has put 19 official solves on the record across five events.
Standing, event by event
vs everyone ever ranked| Event | PB single | PB average | All-time standing | Kazakhstan | |
|---|---|---|---|---|---|
| 3×3 | 37.88 | 42.02 | top 74.4% | 887 / 1,325 | |
| Pyraminx | 16.28 | 21.59 | top 85.9% | 673 / 812 | |
| Megaminx | 4:01.62 | — | early days — 2 solves | 205 / 247 | |
| 2×2 | 16.14 | 20.45 | top 92.0% | 861 / 988 | |
| 5×5 | 4:50.46 | — | early days — 2 solves | 196 / 216 |
Percentile against all competitors ever ranked in each event, a fairer measure than raw rank, because the pools differ by a factor of ten.
The story so far
- 2 Mar 2019First competition: KSF Pavlodar City 2019. A 37.88 3×3 single to start from.
Competitions
- KSF Pavlodar City 2019 · 2 Mar 2019
Reading this page: a single is one solve's time · an average is the middle three of five solves, best and worst discarded · a PB is a personal best · a DNF (did not finish) is an attempt with no valid result: a popped piece, an unsolved face, an over-limit memorisation · top X% compares against everyone ever ranked in that event, which is fairer than raw rank because event pools differ tenfold.
The circuit
The people whose scorecards keep turning up next to his.
- Ilya Tsiareshka — met in 5 rounds, never finished ahead
- Alikhan Yertursyn (Алихан Ертурсын) — met in 5 rounds, never finished ahead
- Nikita Kolpakov — met in 5 rounds, never finished ahead
Next targets
- A sub-30 3×3 single — 180,530 people have one; it is 7.88 away.
- A sub-15 Pyraminx single — 107,130 people have one; it is 1.28 away.
Targets move as he improves.