yzfwsf wrote:champagne wrote:I never worked on suklakus, so I am not sure at all to give the right answer,
but with small adjustments, I think that the process is valid for any start PM with a unique solution.
The first step in the process is to apply the brute solver to find the solution and to setup the start PM.
Later, only unsolved cells and the current PM are used to apply serate rules.
If I am right, a sukaku is a PM that you can't get from a list of given, so you can force the start and the solution.
Is the new code an improvement on the original code, or a rewrite?Please go ahead and support the Sukaku rating system. I’m not sure if the launch will happen in August as scheduled, but I hope for good news. Thank you for your outstanding work!
Hi "yzfwsf",
As I intend to finish with a much faster version of skfr, this will be a complete new code.
Bad effect, I spend plenty of time to optimize each step or the process. Aging and having other constraints, this can finish with more time needed to come to the end.
I am to-day trying to find the best process in the area ER 6.5 / 7.5.
I hoped to have other contributors, this did not come, so we have to work with what a 84 years old guy can do.