[computer-go] The dominance of search (Suzie v. GnuGo)

[Darren Cook]

> (R==1). An incorrect pruning decission is not taken "forever".  The
> general idea is to use information from the search tree to shape the
> search tree. Ulf Lorenz from the Univ. Paderborn considers the search
> tree as an adaptable error filter.
> ...
>> UCT and Monte Carlo.   It's not as much Monte Carlo any longer.
> Yes, ecaxtly. I also think that the difference is fuzzy. Both methods
> fit into the adaptable error filter model of Ulf.

Hi Chrilly,
Do you have a recommendation for a good paper to read on this? Ideally
one that doesn't need specialized chess knowledge to appreciate, but I
may not have a choice: google is giving me 0 hits on "adaptable error
filter".

Darren


-- 
Darren Cook
http://dcook.org/mlsn/ (English-Japanese-German-Chinese free dictionary)
http://dcook.org/work/ (About me and my work)
http://dcook.org/work/charts/  (My flash charting demos)