Author: Dann Corbit
Date: 00:36:21 07/13/02
Go up one level in this thread
On July 13, 2002 at 02:58:21, TEERAPONG TOVIRAT wrote:
>On July 13, 2002 at 01:12:54, Russell Reagan wrote:
>
>>On July 13, 2002 at 00:03:19, Dann Corbit wrote:
>>
>>>Simple programs:
>>>TSCP {lacks hash table and move list}
>>>Olithink {lacks move list}
>>>MSCP {lacks move list}
>>>SCP {Has a move list, but lacks other things}
>>
>>What do you mean by "lacks move list"? Are you talking about the game's home
>>history or what?
>
>I think he mean piecelist array not really movelist array.
>Instead of scanning 64 squares to get information of pieces,we
>just loop through piece array which is shorter.
Sure (when that is appropriate). Imagine when there are 5 chessmen left what
the savings is compared to examination of 64 squares and for each one asking:
Is there a chess guy here?
If there is what kind is it?
Subsequently we must ask what kind is it.
Then we process for it.
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.