CCRL (Computer Chess Rating Lists)
We are a group of testers formed with the goal of producing further rating lists that will go hand in hand with other established rating lists in showing the relativity in engine strength.
At present CCRL has the following testers:
Graham Banks, Ray Banks, Sarah Bird, Kirill Kryukov, Tom Logan, Andreas Schwartmann, Charles Smith and Chris Taylor.
We have concentrated at this stage on a 40 moves in 40 minutes repeating rating list, calibrated to Athlon 64 3800+ hardware, but also intend to produce a blitz list (40 moves in 8 minutes repeating) shortly. Future plans include the possibilty of "endgame rating lists" at the same time controls based on play proceding from a series of endgame positions.
Each engine uses a generic opening book with an upper limit of 12 moves per side. Ponder off, no learning, EGTBs, hash size 128mb or 256mb each (deep engines get twice this size). For blitz it will be 64mb hash
For our first 40/40 rating list, we took a list of 18 engines with the intention of running 30 game matches (all play all) so that we could establish a base from which to develop.
We now present to you the first CCRL 40/40 rating lists at the following link:
http://kd.lab.nig.ac.jp/chess/CCRL-4040/
There is a best versions list, an all versions list and a pure list that removes rating distortions.
There are also many stats tables available for your interest at the above link including:
- pairwise results
- game length statistics
- engine correlation statistics (expected move table, evaluation difference table, engine distance table).
In addition we have opened a CCRL discussion board. You are all welcome to join so that you can discuss our testing and make comments or suggestions on an ongoing basis.
http://kd.lab.nig.ac.jp/chess/discussio ... um.php?f=7
Please note though that general questions about engine testing, not directly related to CCRL, are better posted in other discussion boards, for example WB Forum or here. You will certainly reach more people and get better answers there.
Comments and questions are welcomed.