Attack matching algorithm
I am a level 49 with a town hall level 6. I’m near the top end of a TH6 which means I’m 16 hours from completing the upgrade to a Th7 and everything else is maxed out including my walls. In this current season I have 22 attacks and 3 successful defenses. I put this out there as an example of my playing over a week at TH6. My observations are that the algorithm used to find attacking players seems flawed. Now the flaw might be intentional but it’s not immediately obvious to the player (in this case me). I know I’ve spent well over 1k in gold (single session) searching for a viable adversary. By viable I mean someone I have a chance of getting 1 or maybe 2 stars from.
The flaw I’m speaking of is, I’ve been attacked by players that have no problems completely destroying the town. These same players have towns that are so powerful I have no hope of a successful attack unless they leave their Town Halls unprotected. In contrast during my searches I have to skip a lot of suggestions because I have little to no chance of victory. I would like at least a 50/50 chance.
From my limited observations it seems as if the attack matching algorithm functions mainly on a player’s level. There is probably a modifier of + or - X levels in the algorithm thinking that it is enough to make correct matches.
The problem might be with the window of the levels with finding matches. The algorithm should take into account an attacker’s abilities as well. Additional factors should include a tactical number based on available offensive forces vs defensive forces. A numbering system can be used to simplify the algo, as an example each level 4 Army Camp can be given a value of 4 while a Barbarian King can be given a value of 7. A similar rating can be used for defensive forces such as the level of a town’s walls with the number of level 7 cannon available. Therefore players with an Offensive rating of 15 can be matched with a player with an Defensive rating of 13 - 17. This would still give some variable based on tactics.
Warasin