| Shah_Rukh vs Jin | 17–9 | 65.38% |
| Shah_Rukh vs King | 17–6 | 73.91% |
| Shah_Rukh vs Hwoarang | 11–6 | 64.71% |
| Shah_Rukh vs Kazuya | 10–6 | 62.50% |
| Shah_Rukh vs Azucena | 10–1 | 90.91% |
| Shah_Rukh vs Law | 6–4 | 60.00% |
| Shah_Rukh vs Xiaoyu | 7–3 | 70.00% |
| Shah_Rukh vs Paul | 6–3 | 66.67% |
| Shah_Rukh vs Reina | 7–2 | 77.78% |
| Shah_Rukh vs Victor | 5–4 | 55.56% |
| Shah_Rukh vs Eddy | 6–2 | 75.00% |
| Shah_Rukh vs Bryan | 3–4 | 42.86% |
| Shah_Rukh vs Lili | 4–3 | 57.14% |
| Shah_Rukh vs Dragunov | 3–3 | 50.00% |
| Shah_Rukh vs Leo | 5–1 | 83.33% |
| Shah_Rukh vs Leroy | 3–3 | 50.00% |
| Shah_Rukh vs Steve | 5–0 | 100.00% |
| Shah_Rukh vs Devil Jin | 2–3 | 40.00% |
| Shah_Rukh vs Lars | 3–2 | 60.00% |
| Shah_Rukh vs Jun | 3–2 | 60.00% |
| Shah_Rukh vs Asuka | 3–1 | 75.00% |
| Shah_Rukh vs Alisa | 3–1 | 75.00% |
| Shah_Rukh vs Nina | 3–1 | 75.00% |
| Shah_Rukh vs Feng | 1–2 | 33.33% |
| Shah_Rukh vs Lee | 2–1 | 66.67% |
| Shah_Rukh vs Kuma | 3–0 | 100.00% |
| Shah_Rukh vs Raven | 2–1 | 66.67% |
| Shah_Rukh vs Heihachi | 3–0 | 100.00% |
| Shah_Rukh vs Yoshimitsu | 2–0 | 100.00% |
| Shah_Rukh vs Jack-8 | 2–0 | 100.00% |
| Shah_Rukh vs Claudio | 1–1 | 50.00% |
| Shah_Rukh vs Shaheen | 2–0 | 100.00% |
| Shah_Rukh vs Panda | 1–1 | 50.00% |
| Shah_Rukh vs Zafina | 2–0 | 100.00% |
| Shah_Rukh vs Lidia | 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.