25,161
edits
Changes
no edit summary
It features separate mutually recursive procedures for the main [[Search|search]] and [[Quiescence Search|quiescence search]] for White and Black. [[Evaluation]] is done by [[Piece-Square Tables|piece square tables]], with some positional features added in.
[[Move Ordering|Move ordering]] uses the PST, [[Killer Heuristic|killer heuristic]] and [[History Heuristic|history heuristic]].
The classic [[Triangular PV-Table|triangular array]] is used to return the [[Principal variationVariation|PV]]. So far, LTChess has a simple text style [[User Interface|user interface]].
LTChess 2, released in December 2016, changed to [[Negamax|NegaMax]], added [[Piece-Lists|piece-lists]] to 0x88, now using [[Copy-Make|copy/make]] instead of [[Make Move|make]]/[[Unmake Move|unmake]] <ref>[http://www.talkchess.com/forum/viewtopic.php?t=62365 LTchess 2] by [[Laurie Tunnicliffe]], [[CCC]], December 03, 2016</ref> .
