Module hill_climb

A solution strategy for finding the best chromosome, when search space is convex with little local optima or crossover is impossible or inefficient

Re-exports

pub use self::builder::TryFromBuilderError as TryFromHillClimbBuilderError;

pub use crate::strategy::reporter::Duration as HillClimbReporterDuration;

pub use crate::strategy::reporter::Noop as HillClimbReporterNoop;

Modules

prelude

Structs

HillClimb

The HillClimb strategy is an iterative algorithm that starts with a single arbitrary solution to a problem (unless the genotype seeds specific genes to sample a single starting point from), then attempts to find a better solution by making an incremental change to the solution

HillClimbBuilder

The builder for an HillClimb struct.

HillClimbConfig

HillClimbReporterSimple

A Simple HillClimb reporter generic over Genotype. A report is triggered every period generations

HillClimbState

Stores the state of the HillClimb strategy.

Enums

HillClimbVariant