MatPlus.Net

 Website founded by
Milan Velimirović
in 2006

17:06 UTC
ISC 2024
 
  Forum*
 
 
 
 

Username:

Password:

Remember me

 
Forgot your
password?
Click here!
SIGN IN
to create your account if you don't already have one.
CHESS
SOLVING

Tournaments
Rating lists
1-Jan-2024

B P C F





 
 
MatPlus.Net Forum Competitions Belgrade Internet Tourney 2015.
 
You can only view this page!
(1) Posted by Administrator [Friday, Apr 24, 2015 21:35]

Belgrade Internet Tourney 2015.


BIT 2015 Announcement: http://www.matplus.net/pub/BIT2015.pdf
 
(Read Only)pid=13361
(2) Posted by Marjan Kovačević [Wednesday, May 6, 2015 16:17]

David Shire will be the judge of BIT #2 section
 
 
(Read Only)pid=13412
(3) Posted by Geoff Foster [Friday, May 8, 2015 03:08]

So in Group C, if an author wants his problem to be considered for the award then he has to compete in the solving and judging parts of the event?
 
   
(Read Only)pid=13414
(4) Posted by Marjan Kovačević [Friday, May 8, 2015 12:54]

No, Geoff. It is enough to have a replacement in solving in judging. Usually, there are participants who don't compose, but are willing to solve.
If you wont to participate, do indicate you will not come and we shall look for a solver to replace you. We can not promise to cover all the missing places, but if you send your problem earlier you will have priority on the list of appearances. Last year we had to exclude only 1-2 entries of the composers who didn't come to Belgrade. In that case, quality was a criteria, too.
 
   
(Read Only)pid=13415
(5) Posted by Geoff Foster [Saturday, May 9, 2015 00:40]

Thanks Marjan. I won't be coming to Belgrade, but I want to participate and I've already submitted my problem!
 
   
(Read Only)pid=13416
(6) Posted by Marjan Kovačević [Sunday, May 10, 2015 14:56]

Thanks, Geoff! If thematic and sound, your problem will be solved and judged by the participants!
 
   
(Read Only)pid=13420
(7) Posted by Administrator [Tuesday, May 26, 2015 10:10]

Finally
Received originals
Total: 44 problems
Group A (#2): 18
Group B(h#2): 13
Group C(ser-r#): 13

33 authors from 15 countries (AUS, BLR, CRO, CZE, FRA, GBR, GER, INA, IND, ISR, MAC, RUS, SLO, SRB, UKR)
 
   
(Read Only)pid=13465
(8) Posted by Marjan Kovačević [Wednesday, May 27, 2015 17:54]

Good news for all participants in Group C: with only 13 entries, all of them will be solved and judged by the solvers. This means all entries will find their places in the award, too.
 
   
(Read Only)pid=13466
(9) Posted by Administrator [Wednesday, May 27, 2015 23:03]

BIT 2015 - all participants:

Australia: Geoff Foster
Belarus: Aleksandr Bulavka
Croatia: Ivo Tominić
Czech Republic: Miroslav Svítek
France: Michel Caillaud, Phillipe Robert
Great Britain: Barry Barnes, John Rice
Germany: Ralf Krätschmer
Indonesia: Daniel Wirajaya
India: Seetharaman Kalyan, C.G.S. Narayanan
Israel: Evgeni Bourd, Paz Einat, Emanuel Navon, Menachem Witztum
Macedonia: Zoran Gavrilovski, Živko Janevski, Nikola Stolev
Russia: Valery Gurov, Valery Shanshin, Boris Shorokhov
Slovenia: Marko Klasinc
Serbia: Branislav Djurašević, Marjan Kovačević, Miodrag Mladenović
Miodrag Radomirović, Srećko Radović, Ilija Serafimović, Dragan Stojnić

Ukraine: Mark Basisty, Andrey Frolkin, Anatolii Vasilenko
 
   
(Read Only)pid=13467
(10) Posted by Borislav Gadjanski [Tuesday, Jun 9, 2015 17:35]; edited by Borislav Gadjanski [15-06-10]

BIT 2015 Group C (ser-r#3-6) - Results:
http://matplus.net/pub/BIT15_C.pdf
 
   
(Read Only)pid=13477
(11) Posted by seetharaman kalyan [Tuesday, Jun 9, 2015 20:00]; edited by seetharaman kalyan [15-06-09]

Beautiful problems! This was the theme of 2-WCCT. I am sure that the top ones would have placed high in that tourney !
 
   
(Read Only)pid=13478
(12) Posted by Borislav Gadjanski [Wednesday, Jun 10, 2015 08:28]

BIT 2015 Group A (#2) - Results:
http://matplus.net/pub/BIT15_A.pdf
 
   
(Read Only)pid=13479
(13) Posted by Borislav Gadjanski [Thursday, Jun 11, 2015 07:18]

BIT 2015 Group B (h#2) - Results:
http://matplus.net/pub/BIT15_B.pdf
 
   
(Read Only)pid=13480
(14) Posted by seetharaman kalyan [Friday, Jun 12, 2015 17:20]

All three tourneys have produced very interesting problems. Congrats to the tireless organisers and all the participants/winners.
 
 
(Read Only)pid=13483
(15) Posted by Juraj Lörinc [Saturday, Jun 13, 2015 08:43]; edited by Juraj Lörinc [15-06-13]

As regards series-reflexmates, in my opinion the 2nd place by Evgeni Bourd is the best. Two solutions might be less coherent than in the 1st place, but the wealth of threatening white checkmates make the problem excellent nut for solving in spirit of the genre and at the same time there is nice formal theme: model mates on the same square - unexpected in this setting. Really, note black economy - no technical officers, something not matched by any of other top problems.

Very good output of the tourney in general, congratulations!

Edit: I have also looked at the award of twomowers tourney after writing the comment and... I am totally astonished by the 1st prize. Having dedicated a lot of composing effort to line themes in fairy settings with their much wider possibilities, I know how difficult it is to set up Isaev theme in multiple phases. To do it in such convincing manner in orthodox #2... hats off!
 
   
(Read Only)pid=13484
(16) Posted by Marjan Kovačević [Saturday, Jun 13, 2015 14:19]

Juraj, I completely agree with you about both problems.
Bourd's spectacular firework maybe suffered from democratic judging by solvers. Probably black economy and Model mates on the same square went unnoticed by some, but in general this work used most of the huge possibilities of "playing for two goals" this genre offers. I hope series reflex mate with more solutions will be further explored in another big TT!
Dragan's #2 brought the classic combination we've been waiting for a long time!!
 
   
(Read Only)pid=13486
(17) Posted by Evgeni Bourd [Monday, Jun 15, 2015 19:31]

I think you guys are wrong, Marjan's problem is just better ( even with that annoying Bh7 ). It is much more coherent and harmonic.
I would imagine the same as seeing a helpmate for the first time, would you prefer a nice harmonic combination or a somewhat simple theme with difficult solving? ( Well I guess I am asking the composers here and not the solvers ).
My evil plan was to make a somewhat difficult problem but still keep some decent content ( mates on same square + model mates ) as mentioned.
I wonder if there were any successful solvers for my problem.
A missed problem from the tourney in my opinion is 8th place, the idea is truly great ( maybe too great ) and the clumsy position/solutions might be the sad price for the difficulty...
 
   
(Read Only)pid=13493
(18) Posted by Miodrag Mladenović [Tuesday, Jun 16, 2015 07:08]; edited by Miodrag Mladenović [15-06-16]

@Evgeni

If you think your problem was harder to solve than Bulavka's (8th place) you are wrong. I managed to solve your problem but I found just two solutions in Bulavka's. Although your problem has more moves there are only few mating positions possible so that's why it was easy to solve it. Of course it's amazing how many tries are there. You have to be very careful not to checkmate bK.

And yes, I do agree that Bulavka's problem should be ranked higher.

By the way, it will be nice to create table with number of points that solvers won per problems (to see difficulty of problems). In my personal opinion Bulavka's and Marjan's problem were most difficult to solve.

By the way, congratulation for 3 first places at SuperProblem TT-139. Nice problems.
 
   
(Read Only)pid=13494
(19) Posted by Georgy Evseev [Wednesday, Jun 17, 2015 09:34]

I would like to join this lively discussion concerning SR# section of BIT.

From my point of view the problems of Bourd, Bulavka and Kovacevic is a whole grade better than all others.

While choosing between them, the economy had become my decisive criteria. SR# is in reality a kind of helpplay problem and as such technical pieces of mating side go against my aesthetic feelings).

So, I had not found any excuses for Bh7 in Kovacevic problem and Sh2 in Bulavka problem and had given them 9 points to each, while Bourd problem had received 10 points from me.
 
 
(Read Only)pid=13497

No more posts


MatPlus.Net Forum Competitions Belgrade Internet Tourney 2015.