Author: Tord Romstad
Date: 04:11:03 04/17/03
Go up one level in this thread
On April 15, 2003 at 20:40:32, Ian Osgood wrote: >http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/clocc/clocc/src/games/cil/ Thanks! This was another project I was not aware of. >It is a bitboard toolkit for CLISP Not CLISP, but Common Lisp! CLISP is the name of one particular implementation of Common Lisp. It has some great features, including a very small memory footprint, very efficient functions for bignum arithmetic, and wide availability. Its main disadvantages is that it has no native-code compiler (it compiles to bytecode only) and that it does not implement important parts of CLOS (the Common Lisp Object System). If you want an abbreviation of "Common Lisp", please use "CL". Using "CLISP" will just cause confusion. >(written by Steven J. Edwards, of PGN fame) >which only includes mate-solving search algorithms. It appears to use >imperative style programming. One user reported it being slower at move >generation than his own LISP prototype of a mailbox chess program. As most of SJE's code, I initially found it extremely long and verbose and somewhat hard to read. I will try to digest it later. Apparently it uses a bitboard architecture, which is probably hard to make efficient in Lisp. I am not surprised that a mailbox program is faster. Tord
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.