Author: Bruce Moreland
Date: 10:38:24 12/30/00
Go up one level in this thread
On December 30, 2000 at 04:13:23, Gian-Carlo Pascutto wrote: >On December 30, 2000 at 03:25:46, Bruce Moreland wrote: > >>Mine uses a move table, so I just store a pointer to the move table element for >>the best move in the hash table. When I generate moves I will notice if that >>move is generated, and I will search it first. >> >>bruce > >Interesting...so you do not try to avoid doing the movegen? > >I always thought there should be a significant speed advantage >when doing things the way Bob describes so I wonder why you do >not do it. I didn't want to maintain a bunch of complicated logic to handle this. I may have tried once and seen not much improvement, but I can't remember for sure. bruce > >-- >GCP
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.