|Robert Hyatt||engine programmer|
|チェス, 2006, トリノ||18||6.0||11|
|チェス (Blitz), 2006, トリノ||14||6.5||13|
|チェス, 2005, レイキャビック||12||6.5||11|
|チェス (Blitz), 2005, レイキャビック||8||2.5||7|
|チェス, 2004, ラマット・ガン||14||7.0||11|
|チェス (Blitz), 2004, ラマット・ガン||8||4.5||7|
|チェス, 2001, マーストリヒト||18||5.0||9|
|チェス (Blitz), 2001, マーストリヒト||14||3.5||9|
|チェス, 2000, ロンドン||14||3.5||9|
|チェス, 1997, パリ||34||5.5||11|
|チェス (Blitz), 1997, パリ||22||4.5|
|チェス, 1996, ジャカルタ||27||7.0||11|
DescriptionDescription given in 1997:
Crafty is a "bitmapper" using 64 bit words to represent the chess board, along the lines of the famous Chess 4.x program from Northwestern University. It uses a traditional alpha/beta search with the PVS (null- window) enhancement, along with null-moves (R=2) and lots of search extensions including "fractional ply extensions" to drive the search deeper along interesting lines. It has a very simple quiescence search that only considers capture moves and is fairly selective about which captures are included. It does a full endpoint evaluation, with no root pre-processing nor incrementally updated scoring terms. It is currently about 37,000 lines of ANSI C with about 3,000 lines of that being evaluation. Since Crafty uses bitmaps, much of the evaluation is significantly shorter than it would be in a more traditional (array-based) board representation, so that this 3,000 lines of code is somewhat misleading (for example, to ask "can this pawn run and promote before the opposing king can get there?" only takes one line of code in Crafty.
It is still very fast, searching around 100,000 moves per second. At 60 seconds per move, it solves 297/300 of the Win At Chess tactical positions. It has a large opening database composed from 250,000 GM games, and uses 3-4-5 piece endgame databases during the search (not just at the root of the tree.) It has played over 100,000 games during the past two years, playing on various chess servers around the world, and has maintained ratings on these servers that are always near the very top.