On Tue, 2009-02-17 at 23:29 -0800, David Fotland wrote:
It's not true that MCTS only goes a few ply. In 19x19 games on 32 CPU
cores, searching about 3 million play outs per move, Many Faces of Go
typically goes over 15 ply in the PV in the UCT tree.
That's what I meant when I said a few ply.
At the moment I (and another member of my group) are doing research on
applying machine learning to constructing a static evaluator for Go
positions (generally by predicting the final ownership of each point
on the board and then using this to estimate a probability of
winning). We are looking
I'd be more than happy to work with you and the other members of your
group. I'm getting close to wrapping up a restructuring of my bot that
allows easily swapping out evaluation methods and search techniques.
As an example, here's the code that does a few basic MC searches:
11 static if
Dahl
Verzonden: di 17-2-2009 18:27
Aan: computer-go
Onderwerp: [computer-go] static evaluators for tree search
At the moment I (and another member of my group) are doing research on
applying machine learning to constructing a static evaluator for Go
positions (generally by predicting the final
Van: computer-go-boun...@computer-go.org namens George Dahl
Verzonden: di 17-2-2009 18:27
Aan: computer-go
Onderwerp: [computer-go] static evaluators for tree search
At the moment I (and another member of my group) are doing research on
applying machine learning
On Tue, 2009-02-17 at 20:04 +0100, dave.de...@planet.nl wrote:
A simple alfabeta searcher will only get a few plies deep on 19x19, so
it won't be very useful (unless your static evaluation function is so
good that it doesn't really need an alfabeta searcher)
I have to say that I believe this
On Tue, Feb 17, 2009 at 8:23 PM, George Dahl george.d...@gmail.com wrote:
It is very hard for me to figure out how good a given evaluator is (if
anyone has suggestions for this please let me know) without seeing it
incorporated into a bot and looking at the bot's performance. There
is a
-go.org namens Don Dailey
Verzonden: di 17-2-2009 20:57
Aan: computer-go
Onderwerp: RE: [computer-go] static evaluators for tree search
On Tue, 2009-02-17 at 20:04 +0100, dave.de...@planet.nl wrote:
A simple alfabeta searcher will only get a few plies deep on 19x19, so
it won't be very useful
From: dhillism...@netscape.net dhillism...@netscape.net
Perhaps the biggest problem came from an unexpected quarter. MC playouts are
very fast and neural nets are a bit slow. (I am talking about the forward
pass, not the off-line training.) In the short time
GPUs can speed up many types of neural networks by over a factor of 30.
- George
On Tue, Feb 17, 2009 at 8:35 PM, terry mcintyre terrymcint...@yahoo.com wrote:
From: dhillism...@netscape.net dhillism...@netscape.net
Perhaps the biggest problem came from an
: Tuesday, February 17, 2009 11:58 AM
To: computer-go
Subject: RE: [computer-go] static evaluators for tree search
On Tue, 2009-02-17 at 20:04 +0100, dave.de...@planet.nl wrote:
A simple alfabeta searcher will only get a few plies deep on 19x19, so
it won't be very useful (unless your static
-go.org [mailto:computer-go-
boun...@computer-go.org] On Behalf Of George Dahl
Sent: Tuesday, February 17, 2009 11:23 AM
To: computer-go
Subject: Re: [computer-go] static evaluators for tree search
You're right of course. We have a (relatively fast) move pruning
algorithm that can order moves
12 matches
Mail list logo
