| 민성구리 vs Kazuya | 61–21 | 74.39% |
| 민성구리 vs Bryan | 42–25–1 | 62.69% |
| 민성구리 vs Armor King | 42–22 | 65.62% |
| 민성구리 vs Paul | 48–12 | 80.00% |
| 민성구리 vs Hwoarang | 41–13 | 75.93% |
| 민성구리 vs Jin | 25–23 | 52.08% |
| 민성구리 vs Dragunov | 34–12 | 73.91% |
| 민성구리 vs Reina | 26–13 | 66.67% |
| 민성구리 vs Heihachi | 23–16 | 58.97% |
| 민성구리 vs Steve | 20–15 | 57.14% |
| 민성구리 vs Law | 20–13 | 60.61% |
| 민성구리 vs King | 17–12 | 58.62% |
| 민성구리 vs Yoshimitsu | 12–17 | 41.38% |
| 민성구리 vs Asuka | 15–12 | 55.56% |
| 민성구리 vs Feng | 19–8 | 70.37% |
| 민성구리 vs Leo | 18–8 | 69.23% |
| 민성구리 vs Devil Jin | 18–7 | 72.00% |
| 민성구리 vs Azucena | 16–9 | 64.00% |
| 민성구리 vs Jun | 10–12 | 45.45% |
| 민성구리 vs Alisa | 11–10 | 52.38% |
| 민성구리 vs Claudio | 15–5–1 | 75.00% |
| 민성구리 vs Lars | 12–8 | 60.00% |
| 민성구리 vs Eddy | 12–8 | 60.00% |
| 민성구리 vs Nina | 12–7 | 63.16% |
| 민성구리 vs Victor | 12–7 | 63.16% |
| 민성구리 vs Fahkumram | 12–7 | 63.16% |
| 민성구리 vs Lili | 10–7 | 58.82% |
| 민성구리 vs Clive | 10–5 | 66.67% |
| 민성구리 vs Jack-8 | 6–8 | 42.86% |
| 민성구리 vs Leroy | 8–6 | 57.14% |
| 민성구리 vs Lidia | 9–5 | 64.29% |
| 민성구리 vs Zafina | 8–3 | 72.73% |
| 민성구리 vs Xiaoyu | 4–3 | 57.14% |
| 민성구리 vs Lee | 5–2 | 71.43% |
| 민성구리 vs Raven | 6–1 | 85.71% |
| 민성구리 vs Panda | 4–2 | 66.67% |
| 민성구리 vs Anna | 3–2 | 60.00% |
| 민성구리 vs Kuma | 0–4 | 0.00% |
| 민성구리 vs Shaheen | 2–0 | 100.00% |
Limitations
This data is often requested to give insight into which characters you have more trouble with than others, but it is not particularly helpful for that. The main issue is that it is heavily skewed by how strong the opponents you play are.
For example, this data suggests my worst matchup is clearly vs Reina, but that's just because most of those games are vs Yagami.
There is a way to account for this being worked on. The central idea is to assign each matchup a rating vs you which adjusts based on the result, much like the regular rating but also based on the rating of each player. With this, it would give a better summary of how well you perform vs each character.
In the meantime, this page is here to present the data as requested.