Author: Andrew Dados
Date: 11:18:48 05/07/99
Go up one level in this thread
On May 07, 1999 at 13:50:29, James Robertson wrote:
>On May 07, 1999 at 09:01:26, Steve Maughan wrote:
>
>>I like the defenition used by Chris Whittington. He says that a knowedege bases
>>program is one that uses incremental move generation.
>>
>>Do we know which programs have incremental move generation?
>
>I would wager every commercial program does.
>
>>
>>Regrards
>>
>>Steve Maughan
>>
>>PS What I mean my incremental move generation is that by moving a piece from A
>>to B some moves are added to the move stack and others are removed. The
>>alternative is to create the move stack at each node.
>
>This does not make sense. I understand adding moves to the move stack (every
>program must do this, and there is no alternative), but removing moves will
>destroy the search.
I've met the term 'incremental move generation' in a meaning there is no
'move stack'. Instead moves are searched one-by one, as they are generated.
Fairly old concept...and tricky... (for one, no history heuristic can be
applied)
Regards
-Andrew-
>
>James
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.