Changes

a chess program by [[Lex Loep]], which played the [[WCCC 1995]], the [[UPCCC 1994]], as well as various [[Dutch Open Computer Chess Championship|Dutch Open Computer Chess Championships]] and [[Aegon Tournaments]]. LChess was market as ''Schaakmeester'' in the [https://en.wikipedia.org/wiki/Netherlands Netherlands], running under [[MS-DOS|DOS]] with an own [[GUI]], and was later ported to natively run under [[Windows|Windows NT]] <ref>[http://www.lokasoft.nl/history.htm History of ChessPartner]</ref>. In the late 90s, LChess aka ''Schaakmeester'' for Windows evolved to [[ChessPartner]] <ref>[http://groups.google.com/group/rec.games.chess.computer/browse_frm/thread/ccff9c16b2022c6a ChessPartner 4.0 available] by [[Lex Loep]], [[Computer Chess Forums|rgcc]], October 9, 1998</ref> with GUI and an protocol adapter compliant to the [[Chess Engine Communication Protocol|Chess Engine Communication]] and [[UCI]] protocols, to support other [[:Category:WinBoard Engines|WinBoard]] and [[:Category:UCI Engines|UCI engines]] <ref>[http://www.lokasoft.nl/chesspartner.aspx ChessPartner 6.0]</ref>, market by [[Lokasoft]] and as ''Chess Champ'' by [https://en.wikipedia.org/wiki/Tuna_Technologies Phoenix Games] <ref>[http://www.mobygames.com/game/windows/chess-champ Chess Champ for Windows (2003) - MobyGames]</ref>.

The first version of LChess was written in 1987. In 1988 it participated for the first time in the Dutch Computer Chess Championship, ending 13th in a field of 16; the best result was in 1990 when it ended on a shared 3rd place. Lex Loep has steadily worked on the chess engine and the version which is playing in the WCCC has been ported to Windows NT. Techniques used by the chess engine include [[Alpha-Beta|alpha-beta]] search, [[Iterative Deepening|iterative deepening]], [[Principal Variation Search|PVS]], [[Null Move|null moves]] for [[Null Move Pruning|pruning]] and [[Null Move Pruning#ThreatDetection|thread detection]], [[History Heuristic|history tables]], [[Killer Heuristic|killer heuristics]], [[Transposition Table|transposition tables]] and [[Refutation Table|refutation tables]]. Tactically the program plays very well, and is particularly good in finding mate threads. Positionally there is still a lot of work to do. On the Reinfeld test set it scores more than 80% with 1 minute CPU time on a [[x86|Pentium 90]]. Search speed is 30,000 - 50,000 [[Nodes per secondSecond|nodes/second]]. [[Ger Neef]] wrote the user interface.