Hagrid

Home * Engines * Hagrid

Hagrid, a WinBoard and UCI compliant chess engine by Klaus Friedel, written in C++, first released in March 2002, while the development started as recently as September 2001. Hagrid is a bitboard engine and performs Rotated Bitboards to determine sliding piece attacks, while its successor Snitch keeps the plain 8x8 board and piece-lists, using attack tables.

=Features=

Search

 * Iterative Deepening
 * Aspiration Windows
 * Alpha-Beta PVS
 * Transposition Table
 * Selectivity
 * Fail-High Reductions
 * Null Move Pruning (R=2)
 * Quiescence Search
 * Futility Pruning
 * Delta Pruning
 * Static Exchange Evaluation
 * Move Ordering
 * Killer Heuristic
 * History Heuristic
 * MVV/LVA

Evaluation

 * Material
 * Piece-Square Tables
 * Lazy Evaluation
 * Pawn Structure
 * Pawn Hash Table
 * King Safety
 * Tuning

Misc

 * Nalimov Tablebases

=See also=
 * Snitch

=Forum Posts=
 * New engine "Hagrid" by Klaus Friedel, CCC, March 30, 2002
 * New Chess Engine "Hagrid" by Tony Worsman, Winboard Forum, March 30, 2002
 * Hagrid new version by Klaus Friedel, Winboard Forum, April 01, 2002
 * Hagrid and Chessbase (Fritz 6) GUI by Roger Brown, Winboard Forum, April 03, 2002 » Fritz GUI
 * Hagrid 0.7.2 available by Klaus Friedel, Winboard Forum, April 13, 2002
 * Hagrid 0.7.45 released ! by Klaus Friedel, CCC, June 16, 2002
 * Re: ...a new Hagrid-version? by Klaus Friedel, CCC, October 08, 2003
 * New engine by Klaus Friedel, Winboard Forum, January 03, 2004
 * New engine Snitch 1.0.0 by Klaus Friedel, Winboard Forum, September 28, 2004

=External Links=

Chess Engine

 * Snitch and Hagrid two free UCI / Winboard chess engines
 * Index of /chess/engines/Norbert's collection/Hagrid (Compilation)/v0.6.32/hagrid by Norbert Raimund Leisner hosted by Kirill Kryukov
 * Index of /chess/engines/Norbert's collection/Hagrid (Compilation)/v0.7.47/hagrid by Norbert Raimund Leisner hosted by Kirill Kryukov

Misc

 * Rubeus Hagrid from Wikipedia
 * Magical creatures in Harry Potter from Wikipedia

=References= Up one level