Re: [computer-go] Computer Go hardware

[Peter Seibel <peter@xxxxxxxxxxxxxx>]

"Frank de Groot" <frank@xxxxxxxxxxxxxxxxx> writes:

>> But that was a bit knee-jerk: you could need a different 1,000
>> patterns at different times.
>
> Correct.
> Otherwise I would not need ten million :)
>
>> Maybe I don't understand what you mean by "lookup a pattern"? I.e.
>> what are the keys and what are the values in the "pattern
>> database".
>
> My pattern database is a set of Zobrist hashes. Every time a move is
> played, hundreds of patterns on the board change (700 or so).
>
> I look up those changed pattern in the pattern database and sort
> them in order of how "good" they are, to feed the move suggester.

I see. So the patterns are extracted from parts of the total position?
And then you look up each pattern (~700 for any given board position)
in the pattern database (using a hash table lookup) to get ... what? A
suggested move relative somewhere relative to the pattern on the board
and a "goodness" score for that move? (I'm just guessing here.)

-Peter

-- 
Peter Seibel                                      peter@xxxxxxxxxxxxxxxxx

         Lisp is the red pill. -- John Fraser, comp.lang.lisp
_______________________________________________
computer-go mailing list
computer-go@xxxxxxxxxxxxxxxxx
http://www.computer-go.org/mailman/listinfo/computer-go/