PBT is a Model-Based training algorithm that uses an algorithm that is similar to alpha-zero and its implementation of monte carlo tree search to train neural network agents, this method consist of 3 phases per iteration which are:

• Agents play against each other or against themselves to collect shared training data and results.

• Each agent train using the shared data with different hyperparameters than other agents.

• Each agent plays against all other agents a number of matches per opponent alternating between sides (Black or White) (Round Robin).
• A copy of Top 20% of the agents will replace lowest 20%, including network parameters, however each of the hyperparameters has a chance to be multiplied by 1.2 or 0.8(divided by 1.2 in this implementation) allowing us to get rid of the least sufficient training hyperparameters while have the ability to explore better hyperparameters candidates.
• This implementation differs from the Paper by keeping track of the strongest agent so far by matching the strongest agents each iteration against the current strongest agent so far.

• Python 3.10.4 environment.
• git.

• Download or pull this github repo

  git clone https://github.com/rusenburn/PBT.git

• Install python libraries using requirements.txt file

  pip install -r requirements.txt