The use of chess algorithms in password protection software

Many people in the world today use password protection software. It is the ultimate safeguard between billions being stolen from bank accounts, or sensitive data being stolen. Password protection is one of the cornerstones of why people use the internet. 
To protect passwords from hacking, complexity is required. The system I suggest affords password protection software that complexity. I speak of a system where numerous combinations can be attained. I speak of chess, the game of complexity and combinations. 
There is a famous saying that there are more possible ways a game of chess can play out than there are atoms in the solar system. That level of complexity is what would secure the future of password protection! So what I am basically talking about is a password protection system utilizing the complexity than chess games provide. 
The way to do this, is to find common ground between chess algorithms and password protection algorithms. Chess algorithms comprise the ability to find trillions of ways a chess position can play out, after every chess move is played. The numerousness of variations can be substituted in a password protection software to provide complex combinations in password protection algorithms.
For example, envision a password protection system that has A, B, and C possible ways a system could play out, after a certain button is keyed. If a chess algorithm were to supply a near infinite number of similar variations, imagine the complexity of that password protection system. I am no expert on software or chess algorithms, but the important point I want to make is that if the complexity of chess were to be substituted in a password protection system, that system would be nearly immune from hacking or detection.
Chess is the game of infinite possibilities. A game of chess can play out in a trillion different ways. Password protection systems need that complexity for safeguard. Chess algorithms could be the future of password protection software, supplying that complexity to a sensitive system!

k

Chess algorithms are mainly either brute force calculations (classic design) of probabilistic outcomes based on seeing a lot of previous positions and outcomes, giving possible win probabilities (newer NNUE architectures).. Those are added with evaluation functions to estimate the strength of the position, depending on implementation (classic design and some NNUE engines may have a hybrid design).

I don't believe any of that would really help with encryption of password protection.

Circumlocution . There are more atoms in solar systems than ways chess game can be played out, maybe it's trivial because that is both ridiculously astoundingly high like over quadrillion amount of ways.I think we can verify this correct?