In Julia’s Fairies 2019/I tourney took part 43 problems. It is slightly less than in previous tournaments on Julia’s website and in my opinion, the quality of published problems was lower too. Not in general – I considered relatively high number of problems for low distinction – but I missed problems impressive at the first look.
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…
I believe, even those who don’t have any close relations with Retro/PG problems will enjoy the introduction to this award! But what to say about the lovers of this genre?.. I think it’s so wonderful gift to all of you! Very much grateful to Dirk for so fast and interesting judgement (I have to tell that the first draft version of the award was sent to me 2 months ago, and I’m the only reason of the delayed publication)!
Congratulations to the winners and to all participants of this 2-years long competition!
With a gratitude to Shankar Ram, who for the 2nd time kindly accepted judging of JF original fairy problems and has made his Award so fast! Enjoy the selection of the problems, the statistical summary of 19 kinds (!) provided by the judge, and theAward JF-10/2017-03/2018itself fully designed by Shankar Ram! Thanks a lot to all participants and congratulations to the winners!
For those of you who are not sleeping yet I’ve prepared something special for this night – to read or to celebrate! With the gratitude to the judge, IGM Petko Petkov, for his enthusiastic and tremendous work to make thisAward(among some more others) ready before the end of 3-years cycle!
For polishing English I’m very thankfull to Stephen Emmerson, who was so kind to offer me his help, and who’s nice style of writing we all can enjoy now.
Congratulations to the winners! Sincerely glad for all of you! Wishing you to be the same successful in the New Year 2019!
And.. of course, your best works are always welcome on JF! – Julia
I’m very grateful to Julia for her invitation to judge this interesting fairy retro tourney: I’m convinced that carefully selected fairy conditions (more than fairy pieces) will extend the options for interesting retrograde analysis in the future. The most popular current example is AntiCirce with defensive retractors, but the general idea goes back to Thomas R. Dawson (whom else?), and gets more and more popular. → to the Award…
Published with a gratitude to the judge, Thomas Brand /Julia/
“In total, I selected 40 problems, the most I have ever awarded in any tourney I judged. I consider myself a rather strict judge, but this time I had no difficulty finding problems to include in the award. My main difficulty was to leave out many other candidates that were also good and interesting. I can say that it was the strongest tourney I have ever judged. Congratulations for making this happen.” (The judge of JF-2015/I, Kostas Prentos)
Only the first and the longest informal competition on JF, April-December 2012, had more problems and authors than January-June 2015. In 2013-2014 we had six 4-months tourneys, and the 2015/I was the first 6-months tourney. At the end of that period, I felt guilty about giving so much work to Kostas Prentos as the judge. Now, he writes in the award, “neither of us expected such a large number of entries: 169 original compositions and versions, by 57 composers”.
Today, it is time for readers to enjoy the Award of JF-2015/I, appearing like a booklet of selected problems… The 23 pages of the award include not only detailed comments for 40 rewarded problems (the comment to the 1st Prize takes 1,5 pages!), but also some remarks for 44 problems left out of the award… What an appreciation for the work of all composers!
And the last, more technical detail: the award you see was fully prepared by Kostas, with all the diagrams and links to original publications, leaving me without work… and words to thank him!
My sincere congratulations to the authors of rewarded problems and gratitude for all the comments, always highly appreciated by the authors and judges.
I believe I have a very nice surprise to you (same as it was for me), as who could expect to see the Award in a few months after the end of informal tournament? From 87 problems judged 34 problems rewarded, and the Award with diagrams is fully prepared for publication by the judge:
My sincerest gratitude to the judge, and congratulations to all authors of rewarded problems! As always, I’m inviting all readers to give a feedback to the authors of published problems, to tell what you like in the problems, remembering that not only the improvements or critics are of the main importance.
The Award is provisional and will become final after one month. – Julia
The selection of 40 out of 127 fairy problems of different kinds! A tremendous work done by the judge, Ofer Comay, in so short period of time!
This is the first Award of JF I have a pleasure to publish for you this year, dear readers and participants of JF’s competitions, and I’m sure you will enjoy this presentation of 40 problems selected as the very best! I have to tell that the both competitions of 2015, I and II, have the biggest number of problems since the first year of JF, 2012, with about 200 problems judged by N.Shankar Ram.
I’m very grateful to the judge, and I heartily congratulate all authors of rewarded problems! My special thanks to all commentators for your interesting questions, creative ideas, and all good words to the authors of published problems! Finally, I would very much like to invite all readers to give a feedback to the authors of published problems, to tell those good words about the problems you liked, remembering that not only the improvements or critics are of the main importance.
The Award is provisional and will become final after one month. – Julia
…and now goes the last Award of the informal tournaments on JF in 2014!
I should tell I’ve received it yet in July, but as two others came almost the same time, I’ve decided to keep the natural order and to start from JF-2014/I and JF-2014/II. Also, I wanted so much to keep more or less regular publications on JF that hadn’t enough time to prepare all awards faster. Today I was really very happy to write to the judge, Kjell Widlert, that the Award is going to be announced this evening; and here it is for you, dear authors and readers:
This 3rd competition of 2014 had the most of published problems. And the Award looks really as a monumental work with so many wonderful problems and so many detailed comments! To tell you how strong was this tournament, I want to quote Kjell’s words from the Award: “I don’t think I have ever felt the need to give 8 prizes in a tourney before!“.
I’m very grateful to Kjell for his work! And, one more time this month, I wish to tell to all the winners how great you are, and to all participants how much I appreciate your activity here!
The Award uses animated diagrams. Only one of them couldn’t be animated (Invisibles), and several problems have some parts of the solutions impossible to animate as well. I’m sorry about it! I’ve tried to check all diagrams several times, but they are many, 33(!), and I apologize for any mistakes I might have made. I appreciate your corrections, if needed!
The Award is provisional and will become final after one month. Also, previous cialis black no prescription years I’ve made diplomas for all JF’s competitions. So I’ll do this year! Just have to ask you for some more patience again.. – Julia.