Author: Steven Edwards
Date: 16:40:21 08/22/03
Go up one level in this thread
On August 22, 2003 at 12:42:58, Tord Romstad wrote: >On August 22, 2003 at 12:11:10, Steven Edwards wrote: >>Also, back around six years ago, I wrote a bitboard chess application >>foundation, including a simple mate finder, all in Common Lisp. I gave a copy >>to the AI repository at Carnegie Mellon; they might still have it on ftp. >I think I saw it once, but I didn't look very much at it. I have never >been very interested in bitboards. But still, thanks for your effort! >There is not a lot of Lisp chess software out there. Do a google search for "CIL chess lisp" and you'll find that it's made its way into the Debian Linux distribution among other places. Back when I wrote it, there wasn't much of any serious chess software in Lisp, at least none that I could find. I also once wrote a natural language interface to a chess database, all in Lisp. It was kind of like an expanded version of Terry Winograd's Blocks World, but executed in the chess domain. Alas, I have no idea where tho source might be. >I hope to find the time to make a strong Lisp program myself some day, if >only to disprove the old "Lisp is slow" myth. Few coders outside of the Lisp community understand the immense power of expression available in Lisp. It is not uncommon to design a Lisp program that itself, while running, constructs and executes any number of secondary Lisp programs to solve subproblems. And so on down the recursion trail. As these and similar designs are difficult or impossible to perform in languages like C/C++, the "slowness" of Lisp is preferred to the "can't get started at all" of its competitors.
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.