★ wanayoo — archive 1999 http://syseng.anu.edu.au/lsg/knightcap.htmlNouvelle recherche | Portail wanayoo
Knightcap

KnightCap is a learning chess program. It uses a variant of Richard Sutton's TD(lambda) algorithm to modify its evaluation function based on the outcome of its games. It also uses a book learning algorithm to learn opening lines and endgames.

KnightCap runs under various pseudonyms on the main Internet chess servers: KnightCap and WimpKnight on FICS, KnightC on ICC. As WimpKnight it learnt from a 1650 player to a 2100 player in just 308 games.

To learn more about KnightCap and its learning algorithm, see our paper KnightCap: A Chess program that learns by combining TD(lambda) with minimax search by Jonathan Baxter, Andrew Tridgell and Lex Weaver.

If your browser supports java, you can watch a version of KnightCap playing on ICS or FICS with our chess applet.

KnightCap Features:

  • It's free (available under GNU public license).
  • KnightCap learns the parameters in its evaluation function, either by on-line play on the internet chess servers, or by playing against other computers or humans (even itself) in the privacy of your own home.
  • KnightCap learns its own opening book. You get the current book when you download the latest version.
  • KnightCap has on optional 3-D user interface that gives a more realistic over-the-board feel.
  • KnightCap's search algorithm can run on parallel distributed memory machines with significant performance improvement.
  • KnightC's current blitz rating is around 2500 on ICC.

Source code

The source code for KnightCap is available from ftp://samba.anu.edu.au/pub/KnightCap The README file contains instructions for compiling and running.

Andrew Tridgell wrote the original chess engine and the 3-d interface. See the original KnightCap page.

Jonathan Baxter added the learning ability and various patches.

Feedback and patches are welcome.


Return to the Learning Systems Group Home Page.