A86: Re: [OT] Chess algorithm

To: <assembly-86@lists.ticalc.org>
Subject: A86: Re: [OT] Chess algorithm
From: "Kirk Meyer" <kirkmeyer@bigfoot.com>
Date: Sun, 26 Dec 1999 13:55:29 -0700
References: <0.bdf6e59f.2597ce8d@aol.com>
Reply-To: assembly-86@lists.ticalc.org


GNUchess is great because it is free, including the source. It uses a simple
point-based system (with a few tweaks here and there). Note. If you're
thinking of implementing a chess AI on the 86, I'll tell you two things:

[A] I already did it. Using my proprietary algo, it took on average of 10
minutes to decide on moves only 2 levels deep.

[B] Using GNUchess algos (which are definitely faster), you must have at
least 300kb available for data structures, and that's if you want it to be
pretty slow... For a chess algo, the more memory you can get, the better.

----- Original Message -----
From: <Jeanne9005@aol.com>
To: <assembly-86@lists.ticalc.org>
Sent: Sunday, December 26, 1999 1:03 PM
Subject: A86: [OT] Chess algorithm


>
> Does anyone know how computer chess programs decide which peice to move?
If
> not, can you point me to a place where I could find out?
>
> Glen
> tutorial1.cjb.net
>

Follow-Ups:

A86: Re: Re: [OT] Chess algorithm

From: "David Phillips" <david@acz.org>

References:

A86: [OT] Chess algorithm

From: Jeanne9005@aol.com