pub struct MinimaxSolverConfig {
pub max_iter: usize,
pub tol: f64,
pub step_size: f64,
pub step_decay: f64,
pub fd_step: f64,
pub smoothing_mu: f64,
pub fictitious_play_iter: usize,
}Expand description
Configuration for minimax solvers.
Fields§
§max_iter: usizeMaximum number of outer iterations.
tol: f64Convergence tolerance.
step_size: f64Initial step size.
step_decay: f64Step size decay factor (multiplied each iteration for diminishing step sizes).
fd_step: f64Finite-difference step for gradient approximation.
smoothing_mu: f64Smoothing parameter μ for log-sum-exp (used by smooth_minimax).
fictitious_play_iter: usizeNumber of fictitious play iterations (used by game_theoretic_minimax).
Trait Implementations§
Source§impl Clone for MinimaxSolverConfig
impl Clone for MinimaxSolverConfig
Source§fn clone(&self) -> MinimaxSolverConfig
fn clone(&self) -> MinimaxSolverConfig
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl Debug for MinimaxSolverConfig
impl Debug for MinimaxSolverConfig
Auto Trait Implementations§
impl Freeze for MinimaxSolverConfig
impl RefUnwindSafe for MinimaxSolverConfig
impl Send for MinimaxSolverConfig
impl Sync for MinimaxSolverConfig
impl Unpin for MinimaxSolverConfig
impl UnsafeUnpin for MinimaxSolverConfig
impl UnwindSafe for MinimaxSolverConfig
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> Instrument for T
impl<T> Instrument for T
Source§fn instrument(self, span: Span) -> Instrumented<Self>
fn instrument(self, span: Span) -> Instrumented<Self>
Source§fn in_current_span(self) -> Instrumented<Self>
fn in_current_span(self) -> Instrumented<Self>
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self>
fn into_either(self, into_left: bool) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§impl<T> Pointable for T
impl<T> Pointable for T
Source§impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SPwhere
SS: SubsetOf<SP>,
Source§fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct
self from the equivalent element of its
superset. Read moreSource§fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if
self is actually part of its subset T (and can be converted to it).Source§fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as
self.to_subset but without any property checks. Always succeeds.Source§fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts
self to the equivalent element of its superset.