diff options
| author | cjep <cjep> | 2003-04-27 17:08:12 +0000 |
|---|---|---|
| committer | cjep <cjep> | 2003-04-27 17:08:12 +0000 |
| commit | 6e16ede3ff8b49ea1d51c5b40a1f92712aa12202 (patch) | |
| tree | 862e76577a95773ad496a0d3d70e54866396b431 | |
| parent | d5d5b01ecc9da6c90966cf539190739d67160480 (diff) | |
| download | pkgsrc-6e16ede3ff8b49ea1d51c5b40a1f92712aa12202.tar.gz | |
Shorten the description
| -rw-r--r-- | games/knightcap/DESCR | 15 |
1 files changed, 4 insertions, 11 deletions
diff --git a/games/knightcap/DESCR b/games/knightcap/DESCR index be662c43e3a..13a7685713e 100644 --- a/games/knightcap/DESCR +++ b/games/knightcap/DESCR @@ -1,27 +1,20 @@ KnightCap is a chess program written for the Fujitsu AP1000+ parallel -computer (running AP/Linux). It will also run on most unixes, although -you may need to tweak the includes.h file and Makefile. +computer (running AP/Linux). The principal differences between KnightCap and other chess programs are: - - - KnightCap has an optional fully rendered 3D interface, giving a feel much - more like an "over the board" game. - + - KnightCap has an optional fully rendered 3D interface, giving a feel + much more like an "over the board" game. - KnightCap was developed to run on a parallel distributed memory machine, although it also runs on normal unix boxes. - - KnightCap does not have an opening book---instead it keeps a file (brain.dat) of losing moves and inserts them in the hash table at the start of each search. At present it has about 1500 entries, and this makes it a pretty competitive opening player. - - KnightCap learns the parameters of its evaluation function as it plays. The most dramatic example of how this helps is an experiment we conducted on FICS in which KnightCap learnt from a 1650 player - to a 2100 player in just 300 games. See - http://keating.anu.edu.au/~jon/papers/knigtcap.ps.gz for more info on - its learning algorithm. + to a 2100 player in just 300 games. KnightCap now beats gnuchess consistently and is within "coo-ee" of crafty, although I think it needs deeper search or some more dramatic |