* the more difficult single-number elimination. */
int latin_solver_diff_set(struct latin_solver *solver,
struct latin_solver_scratch *scratch,
- int *extreme);
+ int extreme);
typedef int (latin_solver_callback)(digit *, int, int, void*);
/* Use to provide a standard way of dealing with solvers which can recurse;
/* --- Generation and checking --- */
-digit *latin_generate_quick(int o, random_state *rs);
digit *latin_generate(int o, random_state *rs);
int latin_check(digit *sq, int order); /* !0 => not a latin square */