Author: Tom Kerrigan
Date: 00:00:01 02/13/00
Go up one level in this thread
On February 12, 2000 at 22:37:50, Robert Hyatt wrote: >On February 11, 2000 at 18:10:57, Tom Kerrigan wrote: > >>On February 11, 2000 at 14:04:16, Andrew Dados wrote: >> >>>>As for holes in the piece list, I figured you could fill them up: >>>That way your piecelist will not be preserved during search... while it does not >>>have to, it introduces changes into, say, order of generated moves. I am not >>>sure if I want that. >> >>I don't see why that's a big deal. The searches are still deterministic. >> >>-Tom > > >It isn't really deterministic if you do hashing. Try fine 70 and fiddle with >your move ordering to see this. > >But the main thing is that you _must_ be able to produce identical node counts >during testing... I don't see why the node counts wouldn't be identical. I mean, it's not like you're just randomly swapping entries in the piece list. It's all very systematic. -Tom
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.