Hydrola Ltd. in cooperation with Dr. G. Tamir declares a long-standing
competition on chess problems solution thereby granting to the
chess amateurs an original opportunity of combining pleasure and benefit:
- pleasure of finding a solution to a difficult chess problem;
- benefit from the participation in a charity action in the field of medicine.
Each competition lasts 10 rounds (10 days) and starts on the 1st and 15th of every month.
Only those can take part in the competition who have transferred payment from their bank branch by SWIFT to Hydrola account no later than the current competition is over. The payment is 70 USD.
Within the framework of the competition the winners of each round and the whole competition are determined.
The winner of a round will be a competitor who has found the correct solution of the problems and who has sent it the first by Email to email@example.com (the GMT time of receiving the message by the first mail-server is valid).
The winner of the competition is a competitor who has won most rounds.
The winner of the competition has no right to participate in further competitions.
The total receipts of the competition account are distributed
50% of the prize fund are granted to the round winners and 50% - to the competition winner.
The problems of every new round are published at 2.00 p.m. GMT. The solutions to the problems with the full data of the competitor have to be sent by Email within 24 hours after the moment of their publication.
The information on the results of each competition are published on our site no later than 15 days after the competition is over and contains the following:
- 1) the number of recognized participants;
- 2) the correct solutions of the problems;
- 3) the names of the winners of the rounds and the whole competition;
- 4) the charity fund statement on the publication date.
The first competition starts on the 1996 at 2.00 p.m. GMT.
Thank you for reading the announcement.
May the Lord help us in our good deeds!
The white move and win. Find a solution with minimal number of moves.