Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Funny project: Minimum legal chess

Author: Dann Corbit

Date: 14:50:26 04/05/00

Go up one level in this thread


On April 05, 2000 at 17:37:27, William Bryant wrote:
[snip]
>>Just take the list of legal moves.  Suppose that there are N of them, then your
>>choice is:
>>(int)((double)rand() / ((double)RAND_MAX + 1) * N)
>>
>>The game is over when no legal moves exist (draw) or checkmate.
>>
>>And the source lines...
>>A logical line of C can have over 500 characters in C89 and 4095 characters in a
>>logical source line for C9X.
>>;-)
>
>Simplify all variables to 1 letter, no spacing, etc.  You could compress a chess
>program to several hard to read, very long lines.  ____But____ hasn't that been
>done.  Wouldn't it be more interesting to express a simple chess program that
>plays real chess in as small a file as possible without a line limit to at least
>make it readable?

Actually, that's a much more reasonable goal (and what I originally intended).

The output of that project could easily be squished into the cheeky one I
described (fitting into ten lines).



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.