compute iterated majority n = 3 in less than two minutes

Numero7 · Numero7 · commit 4f79501706bb · 2025-05-29T15:51:19.000+02:00
diff --git a/src/cli.rs b/src/cli.rs
@@ -73,7 +73,7 @@ pub struct Args {
         long,
         value_enum,
         default_value = "strategy",
-        help = "Solver output specification."
+        help = "Solver output specification. Strategy will always compute the maximal winning strategy. Yes-no may be faster when the answer is positive, it uses a heuristic trying to find a simple strategy, which is winning but might not be maximal."
     )]
     pub solver_output: solver::SolverOutput,
 }

Original file line number	Diff line number	Diff line change
`@@ -73,7 +73,7 @@ pub struct Args {`
`73`	`73`	`long,`
`74`	`74`	`value_enum,`
`75`	`75`	`default_value = "strategy",`
`76`		`- help = "Solver output specification."`
	`76`	`+ help = "Solver output specification. Strategy will always compute the maximal winning strategy. Yes-no may be faster when the answer is positive, it uses a heuristic trying to find a simple strategy, which is winning but might not be maximal."`
`77`	`77`	`)]`
`78`	`78`	`pub solver_output: solver::SolverOutput,`
`79`	`79`	`}`