diff --git a/Why-Matchmaking-Algorithms-are-So-Important-in-Tower-Rush.md b/Why-Matchmaking-Algorithms-are-So-Important-in-Tower-Rush.md
new file mode 100644
index 0000000..a8a9409
--- /dev/null
+++ b/Why-Matchmaking-Algorithms-are-So-Important-in-Tower-Rush.md
@@ -0,0 +1,13 @@
+
Behind the colorful graphics and intense gameplay of every successful arena battler lies a complex, invisible mathematical engine.
+
This article explores how developers design these algorithms to keep queue times short while maintaining a competitive environment.
+The Elo System Adapted
+
Your trophy count is a numerical representation of your skill; win a match, and you take trophies from the loser.
+
If the system matches you perfectly, you should mathematically have a 50% chance of winning every single game you play.
+Do not expect to win every game.Queue times increase at the top of the ladder.If you drop trophies, the algorithm matches you against easier opponents.
+The Problem of Card Levels
+
The standard Elo system works perfectly for chess because all pieces are equal, but [tower rush](https://git.mqldevelopment.com/madelinemilano) games feature upgradeable cards.
+
The system will try its best to match you with someone who has the same trophies AND a similar tower level.
+Algorithm CheckWeightCurrent RankThe system will always prioritize finding an opponent within a 50-trophy rangeAccount StrengthThe system tries to match levels, but will abandon this check if the queue takes longer than 10 seconds
+Maintaining Competitive Integrity
+
By artificially capping all card levels to a specific number, the algorithm can rely purely on the Elo rating.
+
The algorithm is blind; it only respects victory.
\ No newline at end of file