XA = result by adjudication
XE = exceeded time limit
Latest results from 12/28/2018 are displayed in red.
Not yet started: 0, Ongoing: 0, Adjudication pending: 0, Finished: 78
1st Place (and those Tied for 1st place after tie breaks applied) Qualify for the 6th WebChess Open Final.
A small number of Best performing 2nd place players (after Tie break applied) may also qualify for the 6th WebChess Open Final depending on the number of 1st placed players.
A small chess related voucher will be awarded to 1st placed players. Value will be approximately 40 Euro equivalent varied by the number of qualifiers.
CCE norm achieved by: Darcy Costa, José Luis; Ilyasov, Anatoly Fedorovich; Khokhlov, Andrey Petrovich; Cadenas González, José María; Ronat, Olivier; Puzone, Mario; Pająk, Jakub Lech; Muljadi, Paul
CCM norm achieved by: Darcy Costa, José Luis; Cadenas González, José María; Ronat, Olivier; Muljadi, Paul
This is a server event.
The start date was 2/8/2017.
The end date was 12/31/2018.
ICCF standard time control 10 moves in 50 days with duplication after 20 days is used.
If a player exceeds allowed thinking time in any way, the player will automatically be scored with a loss. Under some circumstances all of the player’s games will subsequently be cancelled (if not already rated).
45 days of leave per year are available to each player.
There is no special leave in this event.
Linear conditionals can be entered.
This tournament allows claims based on the six piece tablebase.
Draw offers are essentially restricted to one offer per player per game (called the Code of Conduct draw rule). See 2017 Playing Rules-Server 2d and/or TD Manual-Server 11.3.3 for details.
Ties are broken by the Baumbach tie breaking rule (see ICCF rule 126.96.36.199).
If needed, adjudicators will be selected by the server.
Other participants can see the games only when they are finished, and at least 10 games are finished in the event.
The public can see the games only when they are finished, and at least 10 games are finished in the event.
This event is organized by Limbert, Neil.