Julia's Fairies

Julia's Fairies

Popeye – short history

I’m happy to  add a new topic to the section about Popeye solving software – 

A short history of POPEYE
by Thomas Brand, Germany
 

I’m very grateful to Thomas for sharing his  memories and I’d like to invite all of you to add your own views of how it all has began… 

I’d like to mention that some time before Thomas Brand has written to me about his own batch-scripts for Popeye he uses for a long time. There’re also some interesting moments to compare with what I’ve written in my Batch-scripts to run PopeyeSo, I’ll add later what I’ve learned!

Also, Thomas has just started his retro blog –  www.thbrand.de – the author tells about: “I hope to have some interesting stuff for retro friends (and also interested beginners). In the moment the articles and pages are mostly “German only”, but I plan to provide English translations or summaries at least.” 


5 months!

10-Sep-2012 
Julia’sFairies is 5 months old!!!

I’m happy to congratulate all of us with a result of our common effort: in 5 months 126 original problems by 41 authors from 21 countries are published!

A nice problem No.126 is just added and I’m happy to welcome world-know German author Hubert Gockel !

From 10-Apr till 09-Septhe site was visited about 11,875 times! 

Total number of unique visits is 2,185 and the statistics of counts of visits shows that 2,645 visits are made by those, who has came more than 201 times! Thank you!!

I guess that most of you are busy composing for WCCC tourneys. Good luck there!!
And welcome, welcome, welcome to Julia’sFairies after WCCC2012 !
Sincerely, Julia 


Update to My Problems 080912

Update to My Problems (3)!

(08.09) Have added 4 more problems to the list in My Problems section – problem No.14problem No.15problem No.16problem No.17. Now I have all problems composed in 2011 in this list.

Few words about the format:

  • the list of problems is shown as a table, where you see problem No. in the first column and a small diagram to get an idea if you wish to look at that problem or not at all! 🙂  The both – problem No. and diagram – are the links to the problem, so you can click on them to see the page with it. 
  • on each page with published problem you can see the second number in a format /99NNN/ – this is a number in ankona database, you can click on it to see how the problem looks there. My published problems in ankona are marked as “public” – so everyone can view them, but [EDIT] option is shown and allowed to the author only.

Site Updates-070912

Updates as of 06-07.Sep /2012:

Just 1 week is left till the 55th WCCC in Kobe! (A month ago I’ve written a short post about it with the links to the WCCC2012 site). I believe that most of you are busy with composing for WCCC tourney, so I’m very grateful to those, who sends me problems the last weeks!

  • (07.09) Happy to present you one more problem by French author – GM Jean-Marc LoustauNo.125 seems to me a very complicated fairy two-mover!
  • I’d like to remind, that you can click on the Original Problems tab on the top to see the whole list of published problems. Problem numbers are links to the problems – click on any number to see the problem. Standard search using Ctrl+F also works for the list.

Site Updates-050912

Updates as of 02-05.Sep /2012:

  • (05.09) One more problem by János Mikitovics is added! Solvers might like No.124Thank you, János, for your activity!
  • (04.09) A new problem by János Mikitovics is added! Please see  No.123
  • (04.09) I’m happy to announce that 2 authors – Valerio Agostini and Petko A. Petkov – have agreed about publishing a joint problem – No.70.1 – you have already seen in the comments to problem No.70.
  • (03.09) I’ve a pleasure to show you 2 problems by Valerio Agostini – please see No.121, 122! I believe that light Valerio‘s problems are nice to analyze, comment, solve, study.
  • (02.09) Welcome to the world-known French author – GM Jean-Marc Loustau! Presenting to you 2 nice problems – No.119, 120!
  • I’d like to remind, that you can click on the Original Problems tab on the top to see the whole list of published problems. Problem numbers are links to the problems – click on any number to see the problem. Standard search using Ctrl+F also works for the list.
  • Just 2 weeks are left till the 55th buy levitra in england WCCC in Kobe! I’ve written a short post about it with the links to the WCCC2012 site.

Update to My Problems

Update to My Problems !

(01.09) 1 more problem is added to My Problems section. You can see it by direct link also – my problem No.9.

(31.08)Have added 3 more problems to my list in My Problems section. I hope, I haven’t done any mistakes when trying to do everything faster. Please let me know if any link doesn’t work. Thanks!!

(30.08) When created a site, I’ve planned to add my published problems here. But with all other activities never had time. Now I’ve decided at least to start!

For now the very first 5 my published problems (4 of them are orthodox helpmates) are added in My Problems section. Hopefully, I will add all the problems in 2-3 weeks. Most likely, I’m the most interested person in this section. It is my memory.. and seems like several first problems for me are the most meaningful. I have written some comments to them. And could write much more! 🙂 The fact is that I remember the time of composing them much better, than for some recent problems I have. I believe, it is the same for many of you.. Or?


Site Updates-280812

Updates as of 26-28.Aug /2012:

  • (28.08) Welcome to the well-known Macedonian author – Bosko Miloseski! Presenting to you a very pleasant problem – see No.118!
  • (26.08) I’m happy to add a joint problem by 2 Hungarian authors – No.117 by Tibor Érsek & János Mikitovics. Welcome to Tibor Érsek and a gratitude to János Mikitovics for the activity!
  • I’d like to remind, that you can click on the Original Problems tab on the top to see the whole list of published problems. Problem numbers are links to the problems – click on any number to see the problem. Standard search using Ctrl+F also works for the list.
  • Tourneys, tourneys!.. Let me repeat, that all fairy computer tested problems published at Julia’sFairies participate in informal tourney JF-2012. Thank you very much for so great activity here! And I’d like to remind you about the thematic tourney, with the closing date 15th of October, HS-problems with battery play – Julia’sFairies-HSP-2012
  • Just 2,5 weeks is left till the 55th WCCC in Kobe! I’ve written a short post about it with the links to the WCCC2012 site.

Solvers @igra.lv

2 “solving days” in Riga – 23-24.Aug –
for those, who never solved before!

This post is dedicated to Latvians (Rigans really), who participates in the project IGRA.lv. (“igra” in Russian = game). This is not about chess at all! Commands, who participate in the game, have to do many very different things. This time a pre-game to get the additional bonus was to solve a fairy problem!

The problem above was composed for this game. So, it was impossible to find a ready solution in the internet. The only information the commands have got was that this is a helpmate (they had to find what it is), has 2 solutions of 2 moves, and a strange figure on d1,h1 was called a “shaman” with a given definition how it moves (in reality it was a simple Lion, but it was also not easy to find out it). The author was not mentioned as well.

Click here to see how the problem was presented to the commands by the organizers of this game (in Russian only). And click on the diagram to see the problem with solution.

  • As I know, at least 2 commands have really solved the problem themselves. Congratulations to you!!! I hope you enjoyed the solving and the happiness at the moment when you have found the right solution! 
  • I was also surprised a lot to see about 10 of you at my site, and you were on the right way looking at fairy terms and at popeye solving program! As I was told, some of you have solved a problem using solving software! So, you have done 2 things: have found the right name of the fairy piece, have learned how to install and to use a program! Congratulations to you too!! It is not that easy if you do it for the first time.

As I know for now, about 7 commands have submitted the right solution. But I don’t know how many commands participated in total.

Dear participants, I had fun during your time of solving… And now I wish you good luck in the real game you have this night!!!

Thank you for solving! – Julia