Enum game::ltn::auto::Heuristic

pub enum Heuristic {
    Greedy,
    BruteForce,
    OnlyOneBorder,
}

Variants

Greedy

Find the road with the most rat-runs that can be closed without creating a disconnected cell, and filter it.

There’s a vague intuition or observation that the “bottleneck” will have the most rat-runs going through it, so tackle the worst problem first.

BruteForce

Try adding one filter to every possible road, counting the rat-runs after. Choose the next step by the least resulting rat runs.

OnlyOneBorder

Per cell, close all borders except for one. This doesn’t affect connectivity, but prevents all rat-runs.

Implementations

impl Heuristic

pub fn choices() -> Vec<Choice<Heuristic>>

pub fn apply(
    self,
    ctx: &EventCtx<'_>,
    app: &mut App,
    neighborhood: &Neighborhood,
    timer: &mut Timer<'_>
)

Trait Implementations

impl Clone for Heuristic

fn clone(&self) -> Heuristic

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for Heuristic

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

Formats the value using the given formatter.

impl PartialEq<Heuristic> for Heuristic

fn eq(&self, other: &Heuristic) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=.

impl StructuralPartialEq for Heuristic