There is a chapter in Ulf Lorenz Dissertation about this topic. Ulf mentions
this aspect also in the Hydra papers. E.g. the one for the XCell Journal.
Search on the net for "Lorenz, Donninger, Hydra" and format "pdf". But in
this papers the concept is only mentioned without a detailed
proof/explanation. This is only done in the Diss.
The title of the Diss. is: Ulf Lorenz: Controlled Conspiracy Number Search,
Paderborn 2000. But the work is in German.
After the match Adams-Hydra Ulf wrote a longer article about his
error-filter theory for the ICGA-journal. But the article was rejected.
Ulf has used this model for a project to improve the robustness of
airplane-schedules. The current algorithms just optimize the scheduling of
airplanes (and the crew), but they have usually no notation of robustness.
If there is a delay in London, then the flight Frankfurt Paris might be
delayed too, because according the schedule the airplane is used after the
return from London in Frankfurt for the Paris fligth. And this can in turn
delay the flight from Paris to Madrid, because the crew has now - according
the law - to take a rest in Paris, but the scheduling programm calculated
that its optimal that they are also on board for Paris-Madrid and take the
rest in Madrid....
One can consider the time according schedule as a noisy evaluation function
and can try to find more robust solutions which is not much worse than the
best solution. Its a conspiracy approach for scheduling problems.
Chrilly
----- Original Message -----
From: "Darren Cook" <[EMAIL PROTECTED]>
To: "computer-go" <computer-go@computer-go.org>
Sent: Saturday, April 07, 2007 2:18 AM
Subject: Re: [computer-go] The dominance of search (Suzie v. GnuGo)
(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)
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
_______________________________________________
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
