Changes

Elephant applies [[Principal Variation Search|PVS]] [[Alpha-Beta|alpha-beta]] with [[Transposition Table|transposition table]], [[Quiescence Search|quiescence]], [[Null Move Pruning#AdaptiveNullMovePruning|adaptive null move pruning]], [[Internal Iterative Deepening|IID]], [[Razoring|razoring]], [[Futility Pruning|futility pruning]] and various [[Extensions|extensions]], embedded inside an [[Depth#FractionalPlies|fractional ply]] [[Iterative Deepening|iterative deepening]] framework. [[Move Ordering|Move ordering]] at the [[Root|root]] is based on [[Node|node count]], and otherwise considers [[Hash Move|hash move]] including [[Principal variationVariation|principle variation]], [[Static Exchange Evaluation|static exchange evaluation]], [[Killer Heuristic|killer-]] and [[History Heuristic|history heuristic]]. [[Evaluation]] might be [[Lazy Evaluation|lazy]] and takes [[Material|material]], [[Pawn Hash Table|cached]] [[Pawn Structure|pawn structure]], [[King Safety|king safety]], [[Piece-Square Tables|piece-squares tables]], [[Mobility|mobility]] and multiple other terms into account. Elephant was used as testbed to compare various [[Bitboards|bitboard]] techniques in generating [[Sliding Piece Attacks|sliding piece attacks]] <ref>[http://www.talkchess.com/forum/viewtopic.php?topic_view=threads&p=140111&t=16002 Re: BitBoard Tests Magic v Non-Rotated 32 Bits v 64 Bits] by [[Harald Lüßen]], [[CCC]], August 24, 2007</ref>, in particular [[Exploding Bitboards|Exploding-]] and [[Sherwin Bitboards]].

* [https://web.archive.org/web/20120105073311/http://wbec-ridderkerk.nl/html/details1/Elephant.html Elephant] from [[WBEC|WBEC Ridderkerk]]([https://en.wikipedia.org/wiki/Wayback_Machine Wayback Machine])