Reported by Michel Caillaud:
Christian Poisson just released a new version of Winchloe with improved solving for proofgames.
On his site can be found a booklet with 562 (!!) original homebase PGs and some explanations: http://christian.poisson.free.fr/problemesis/problemesis.php
From Readme of v.3.46 (oct.2019)
Solving of proof games (‘partie justificative’) is a little more “intelligent”. A new option in “Solving options” allows you to choose whether short solutions are sought. In this case, a solution in p moves will not be sought if there is a solution in p-n moves (n integer).
I composed some simple proof games to check the programming with several fairy conditions. They are gathered in a pdf available on Problemesis.
Winchloe is (sometimes much) slower than Jacobi, but it is interesting for conditions not implemented in Jacobi, as it is sometimes much quicker than Popeye.
Such the case is for Take&Make, and in solving the 8,0 first moves of 550(1), Winchloé finds the cook :
1.d4 Sç6 2.Bh6 g×h6(ç1=S) 3.Sd2 S×é2(Sé4) 4.Ba6 S×d2(Sb3) 5.a×b3(d2) b×a6(f1=B) 6.R×a7(Ra5) Sé5 7.Qf3 S×f3(Sb7) 8.Sé2 Bg7…
It’s already too late to change the Award by Hans Gruber…