Re: [DISCUSSION] Game Tree vs. Pattern Matching

[Mousheng Xu <xu@xxxxxxxxxx>]

At 08:11 AM 10/29/98 -0800, David Fotland wrote:
>
>If you are talking about a Joseki or Fuseki database, I use game trees for
>both to save space.  I think most of the chess programs use large hash tables
>so they can recognize any position no matter what the history.  A hash table
>using zobrist hashing is not so big.  I use a hash table to record positions

David,

	Since there are so many patterns (hash keys), zobrist hashing table could
still be big. 
	Your comments pushed me to decide using a combination of game tree and
pattern matching. 
	Thanks a lot.

-- Mousheng