title: Seeding the CP-SAT solver
body: <p>In googles OR-tools library, the "Original" CP-Solver (discussed here: <a href="https://developers.google.com/optimization/cp/original_cp_solver" rel="nofollow noreferrer">https://developers.google.com/optimization/cp/original_cp_solver</a>) can be reseeded using <code>.ReSeed()</code>. However, the newer version, CP-SAT cannot. </p>
  
  <p>My assumption is that CP-SAT will exhaustively try every option in your problem, taking the maximum or minimum (depending on your optimisation goal) from the ones that are feasible. Because it tries them all no seeding is required, therefore the option isn't available to you.</p>
  
  <p>Is this understanding correct? If I am, why does the original solver have a seeding? If I am not correct, is the lack of <code>.ReSeed()</code> in the new CpSolver an oversight?</p>