How it works
The password’s entropy in bits is estimated as its length multiplied by the log2 of the size of the character pool it appears to draw from — lowercase, uppercase, digits, and symbols each add to that pool if they appear anywhere in the password. More bits means exponentially more possible passwords an attacker would need to try.
Why “strong” here isn’t a guarantee
This assumes an attacker is trying random combinations from the detected
character pool. Real attackers try common passwords, dictionary words, and
predictable substitutions (like p@ssw0rd) long before brute force, so a
password built from a recognizable word can score well here while still
being an easy first guess.
A better strategy than memorizing rules
A long passphrase of random unrelated words is usually both stronger and easier to remember than a short password crammed with substitutions. Length is the biggest lever this calculation has, and it is also the easiest one to actually use.