Author: William H Rogers
Date: 12:19:19 04/16/03
Go up one level in this thread
On April 15, 2003 at 20:40:32, Ian Osgood wrote: >On April 15, 2003 at 19:55:59, William H Rogers wrote: > >>I remember reading about one written in Lisp a few years ago, but I can not >>point to any reference. It was noted that it was not really suited to the task. >>Bill > >Are you referring to this? The article I was referring to stated that they tried to use a rule-based approach to programming. They did admit that it was very easy to add new rules but they did not think that the program was as stong or as fast as it could be. Bill > >http://cvs.sourceforge.net/cgi-bin/viewcvs.cgi/clocc/clocc/src/games/cil/ > >It is a bitboard toolkit for CLISP (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. > >I was thinking one might obtain interesting and succinct formulations of the >standard search algorithms (alpha-beta, MTD(f), etc.) by expressing them >functionally. I know I got a deeper understanding of alpha-beta by implementing >it in a non-standard way taking advantage of Forth's open stack. > >Ian
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.