a chess program with focus on solving mates, written by Leonid Liberman in x86 assembly to run under DOS, last modified in May 2001, still in it's beta stage . LL Chess represents the board as plain 8x8 mailbox. The search uses several brute-force and selective layers.
- Please, say in few words what can reduce the "branching factor" by Leonid, CCC, September 19, 1999 » Branching Factor
- number of moves in position by Leonid, CCC, September 19, 1999
- What is the q-search? by Leonid, CCC, January 07, 2000 » Quiescence Search
- Branching factor, make me confuse more that ever by Leonid, CCC, April 01, 2000
- What is the average nodes per second for minimax? by Leonid, CCC, June 15, 2000 » Nodes per second
- Is the NPS tend to grow at the end of the game? by Leonid, CCC, July 22, 2000
- Remember Leonid Liberman (author of LLCHESS)? by Dann Corbit, CCC, May 23, 2015
- LL Chess Game - End of the World Production, LLC.
- Chess Introduction by Leonid Liberman
- Procedure for finding the Check by Leonid Liberman
- New Ideas by Leonid Liberman