From 40b87a4bb9c7c59190d6fca1300b19ade036e3bc Mon Sep 17 00:00:00 2001 From: Matthew Butterick Date: Wed, 29 Jun 2022 11:27:18 -0700 Subject: [PATCH] doc typo --- csp/csp/scribblings/csp.scrbl | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/csp/csp/scribblings/csp.scrbl b/csp/csp/scribblings/csp.scrbl index a2f8b81b..13f2227e 100644 --- a/csp/csp/scribblings/csp.scrbl +++ b/csp/csp/scribblings/csp.scrbl @@ -560,7 +560,7 @@ Pass these functions to @racket[current-solver]. generator?]{ The default solver. Conducts an exhaustive, deterministic search of the state space. @italic{Backtracking} means that when the solver reaches a dead end in the search space, it unwinds to the last successful variable assignment and tries again. The details of its behavior are modified by @racket[current-select-variable], @racket[current-inference], and @racket[current-node-consistency]. -The advantage of the backtracking solver: it proceeds through the search space in a systematic matter. If there is a solution, the backtracking solver will find it. Eventually. +The advantage of the backtracking solver: it proceeds through the search space in a systematic manner. If there is a solution, the backtracking solver will find it. Eventually. The disadvantage: the same. Some search spaces are so huge, and the solutions so rare, that concentrating the effort on searching any particular branch is likely to be futile. For a more probabilistic approach, try @racket[min-conflicts-solver]. }