×
About Thomson Problem
The Thomson Problem asks for the minimum electrostatic potential energy configuration of
$N$ electrons constrained to the surface of a unit sphere.
Simulation Logic
This app uses a hybrid approach:
- Genetic Algorithm (GA): Explores the global search space to avoid local minima. It
uses population, crossover (random plane cut), and mutation.
- Gradient Descent (GD): Locally refines each configuration to the nearest energy
minimum.
Parameters
- N: Number of electrons.
- Population: Number of configurations in the GA.
- Mutation Rate: Probability of random perturbation.
- Learning Rate: Step size for Gradient Descent.
- Convergence: Precision threshold for GD stopping.