pgsolver 4.3 (latest) · OCaml Package

val register : unit -> unit

val enable_exp_bit_count : bool Stdlib.ref

val get_last_exp_bit_count : unit -> int

val get_last_iteration_count : unit -> int

val _strat_impr_callback : 
  (Paritygame.strategy -> int -> unit) option Stdlib.ref

type node_total_ordering_fun =
  Paritygame.paritygame ->
  Paritygame.node ->
  Paritygame.node ->
  int

val node_total_ordering_by_position : node_total_ordering_fun

type node_valuation = Paritygame.node * Paritygame.node Tcsset.TreeSet.t * int

type game_valuation = node_valuation array

val evaluate_strategy : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  Paritygame.strategy ->
  game_valuation

val strategy_improvable : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  Paritygame.strategy ->
  game_valuation ->
  bool

val initial_strategy_by_best_reward : 
  Paritygame.paritygame ->
  Paritygame.strategy

val improvement_policy_optimize_all_locally : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  Paritygame.strategy ->
  game_valuation ->
  Paritygame.strategy

val strategy_improvement_optimize_all_locally_policy : 
  Paritygame.paritygame ->
  Paritygame.solution * Paritygame.strategy

val best_decision_by_valuation_ordering : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  game_valuation ->
  Paritygame.node ->
  Paritygame.node

val node_valuation_ordering : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  node_valuation ->
  node_valuation ->
  int

val compute_counter_strategy : 
  Paritygame.paritygame ->
  Paritygame.strategy ->
  Paritygame.strategy

val register_sub_solver : 
  (Paritygame.paritygame -> Paritygame.solution * Paritygame.strategy) ->
  string ->
  string ->
  string ->
  unit

type initial_strategy_fun = Paritygame.paritygame -> Paritygame.strategy

type 'a improvement_policy_fun =
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  'a ->
  Paritygame.strategy ->
  game_valuation ->
  Paritygame.strategy * 'a

val strategy_improvement : 
  Paritygame.paritygame ->
  initial_strategy_fun ->
  node_total_ordering_fun ->
  'a improvement_policy_fun ->
  'a ->
  bool ->
  string ->
  Paritygame.solution * Paritygame.strategy

val strategy_improvement'' : 
  Paritygame.paritygame ->
  initial_strategy_fun ->
  node_total_ordering_fun ->
  'a improvement_policy_fun ->
  (Paritygame.paritygame -> 'a) ->
  bool ->
  string ->
  Paritygame.solution * Paritygame.strategy

val strategy_improvement_by_policy : 
  Paritygame.paritygame ->
  'a improvement_policy_fun ->
  'a ->
  bool ->
  string ->
  Paritygame.solution * Paritygame.strategy

val improvement_policy_no_user_data : 
  ('a -> 'b -> 'c -> 'd -> 'e) ->
  'a ->
  'b ->
  'f ->
  'c ->
  'd ->
  'e * 'f

val node_valuation_total_ordering : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  game_valuation ->
  Paritygame.node ->
  Paritygame.node ->
  int

val best_decision_by_ordering : 
  Paritygame.paritygame ->
  (Paritygame.node -> Paritygame.node -> int) ->
  Paritygame.node ->
  int

val empty_descending_relevance_ordered_set : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  Paritygame.node Tcsset.TreeSet.t

val initial_strategy_by_last_edge : 
  Paritygame.paritygame ->
  Paritygame.strategy

val winning_strategies : 
  Paritygame.paritygame ->
  node_total_ordering_fun ->
  Paritygame.strategy ->
  game_valuation ->
  Paritygame.strategy

type mdplike_valuation =
  ((Paritygame.node, float) Tcsset.TreeMap.t * bool option) array

val mdplike_valuation : 
  Paritygame.paritygame ->
  int ->
  Paritygame.strategy ->
  mdplike_valuation

val compare_mdplike_valuation : 
  Paritygame.paritygame ->
  mdplike_valuation ->
  Paritygame.node ->
  Paritygame.node ->
  int

package pgsolver