Pepe.Chess's blog

Why aren't Div2 (only) rounds rated for some of Div1 Contestants ?
By Pepe.Chess, 10 years ago, In English

Hello

I am wondering why Div2 Contests are unrated for all of Div1 Contestants?

I mean they should be rated for Div1 contestants whose ratings are between 1700 and 2050 ( I mean candidate masters and masters )

Becuase most of them try to solve only the first 3 problems in Div1 Contests (which are C , D , E of div2)

So Why aren't Div2 Contests rated for them ( I mean Div2 Contests which happens without a Div1 ) ?

So they can participate every round ( either in Div2 or if there is a Div1 they participate with reds and international masters :D )

Because it's boring to wait for the next Div1 round .

Who agrees with me ?

  • Vote: I like it
  • +19
  • Vote: I do not like it

»
10 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Well, this can be problematic. It might cause rating inflation. If those div1 contestants perform well, they might get higher ratings without having to complete with reds and international masters. If they don't perform well, they might be judged only by how fast they can solve the two easy ones or div2 people might get higher rating than usual.

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I think it is not that big problem to achieve a rating method for them ... and any author of a Div2 contest can evaluate if his contest is useful for some of div1 contestants

→ Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

If there are Div 2 (only) rounds, why aren't there Div 1 (only) rounds which can be held at the same time as the Div 2 ones? These two rounds do not need to share any problems. This can avoid any problems related to rating changes and more importantly, Div 1 contestants don't have to wait for a long time!

→ Reply
»
9 years ago, # |
  Vote: I like it +10 Vote: I do not like it

CDE of div 2 only round are usually easier than ABC of div 1. Sometimes, authors of div 2 contests give problems which can be solved by typical algorithms, e.g. max flow or obvious usage of segment tree, so solving which problems is easy and not interesting for experienced contestant from div1.

→ Reply