### 2.1.7. Counting view

Considering a constraint for which not all variables are fixed yet, a question is to count, or estimate, its number of solutions. This is useful for writing heuristics that take into account the tightness of the constraints in order, for example, to select the next variable to assign. Considering a pure functional dependency constraint it is interesting to consider how the number of solutions of that constraint varies depending on the value of the pure functional dependency parameter (e.g.,Β in the context of the $\mathrm{\pi \pi \pi \pi \pi \pi }$$\left(\mathrm{\pi ½},\mathrm{\pi  \pi °\pi \pi Έ\pi °\pi ±\pi »\pi ΄\pi }\right)$ constraint, its number of solutions if extremely low when $\mathrm{\pi ½}=1$, then increase as $\mathrm{\pi ½}$ increases up to a point where it decreases again and ends up with $\mathrm{\pi ½}=|\mathrm{\pi  \pi °\pi \pi Έ\pi °\pi ±\pi »\pi ΄\pi }|$ like an $\mathrm{\pi \pi \pi \pi \pi \pi \pi \pi \pi \pi \pi \pi }$). This is for instance useful for ranking pure functional dependency constraints in the context of the constraint seeker

Counting the number of solutions to an $\mathrm{\pi \pi \pi \pi \pi \pi \pi \pi \pi \pi \pi \pi }$ constraint is equivalent to counting the number of maximum matchings in a bipartite graph, which is #P-completeΒ [Valiant79]. Consequently faster approximations for estimating the number of solutions are used in practice