Module exhaustive 

Exhaustive search phase using branch-and-bound.

Exhaustive search explores the entire solution space systematically, using pruning to avoid exploring branches that cannot improve on the best solution found so far.

Exploration Types

• Depth First: Explores deepest nodes first (memory efficient)
• Breadth First: Explores level by level (finds shortest paths)
• Score First: Explores best-scoring nodes first (greedy)
• Optimistic Bound First: Explores most promising bounds first (A*)

Structs

ExhaustiveSearchConfig

Configuration for exhaustive search phase.

ExhaustiveSearchNode

A node in the exhaustive search tree.

ExhaustiveSearchPhase

Exhaustive search phase that explores all possible solutions.

FixedOffsetBounder

A bounder that uses a fixed offset from the current score.

MoveSequence

Tracks the move sequence to reconstruct a solution path.

SimpleDecider

A simple value-based decider that works with any value type.

SimpleScoreBounder

A simple bounder that uses the current score as the optimistic bound.

Enums

BounderType

Bounder type selection.

ExplorationType

Type of exploration strategy for exhaustive search.

Traits

ExhaustiveSearchDecider

Decides how to expand nodes in the exhaustive search.

ScoreBounder

Calculates score bounds for exhaustive search pruning.