Hello,
maybe this is old stuff for the insiders.
In my lecture today a clever student (Hagen Riedel)
brought up the following idea to extend AMAF.
He counts in four ways moves on a specific square:
(1) How often did player A make this move in random games
which he won?
(2) How often did player A
Back in the days of Don's reference bot, I made some similar modifications to
them and posted the results (slight improvement). The postings were around
10/28/08.
Ingo Althöfer wrote:
Hello,
maybe this is old stuff for the insiders.
In my lecture today a clever student (Hagen Riedel)
Thank you for sharing. And I have a question. Did it use Nakade
Heuristic
and fillboardTries in the play out policy?
No, we could not get those to work with Fuego. I believe that our
selfatari correction may have a similar effect to the nakade
heuristic. I don't remember if we did a lot
I will be there for the main conference only.
Martin
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Artificial Genie, Inc is looking to hire a Lead/Senior Software Engineer
and a Software Engineer.
The successful applicants will build our proprietary, patented system
starting from essentially a clean screen-- but working from an extensive
technical and algorithmic outline and in close
2009/5/29 Ingo Althöfer 3-hirn-ver...@gmx.de
Let n(1), ... n(4) be these numbers,
and q(1), ..., q(4) the respective quota.
Would it make sense to combine them by a linear combination, like
lamda(1)*q(1) + lamda(2)*q(2),
where the lamda's are appropriate positve or negative weights.
Any
