Struct JeroslowWangOneSided 

pub struct JeroslowWangOneSided { /* private fields */ }

Implements the Jeroslow-Wang heuristic (one-sided version).

This heuristic scores literals based on their occurrences in clauses, giving higher weight to literals in shorter clauses (specifically, 2^(-clause_length)). When picking a variable, it chooses the literal (variable and polarity) with the highest score among unassigned literals.

There’s a small chance (10%) that the chosen literal’s polarity will be flipped, adding an element of randomness.

Trait Implementations

impl Clone for JeroslowWangOneSided

fn clone(&self) -> JeroslowWangOneSided

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for JeroslowWangOneSided

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for JeroslowWangOneSided

fn default() -> JeroslowWangOneSided

Returns the “default value” for a type.

impl<L: Literal> VariableSelection<L> for JeroslowWangOneSided

fn new<C: AsRef<[L]>>(num_vars: usize, _: &[L], clauses: &[C]) -> Self

Creates a new JeroslowWangOneSided strategy. Initialises scores using init_jw_scores based on the provided clauses. The random number generator is seeded with 0.

fn pick<A: Assignment>(&mut self, assignment: &A) -> Option<L>

Picks an unassigned literal with the highest Jeroslow-Wang score. It iterates through all literals, finds the unassigned one with the maximum score. There is a 10% chance the polarity of this chosen literal will be flipped.

fn bumps<T: IntoIterator<Item = L>>(&mut self, _: T)

JW scores are static, based on initial clause structure.

fn decay(&mut self, _: f64)

JW scores are static.

fn decisions(&self) -> usize

Returns the total number of decisions made by this strategy instance.