Hi Phillip,
Thank you for your help and explanations :)
Dave
Van: computer-go-boun...@computer-go.org namens Philipp Hennig
Verzonden: za 7-3-2009 23:50
Aan: computer-go@computer-go.org
Onderwerp: Re: [computer-go] re-CGT approximating the sum of subgames
Hi Dave,
sorry that I'm so slow in replying.
You are right that there seems to be some confusion about the origin
of the Thompson heuristic, and I am not entirely clear about its
history myself. My understanding so far is that the heuristic wasn't
actually invented by Thompson as such. Rat
as far as I can see, they are citations only.
Dave
Van: computer-go-boun...@computer-go.org namens terry mcintyre
Verzonden: ma 2-3-2009 21:18
Aan: computer-go
Onderwerp: Re: [computer-go] re-CGT approximating the sum of subgames
If you google thompson he
12:15 PM
Subject: RE: [computer-go] re-CGT approximating the sum of subgames
RE: [computer-go] re-CGT approximating the sum of subgames
Hi Philipp,
Thank you for replying. I've seen your article before, but I read it only
superficially then. By the way, I couldn't find any online source ab
Van: computer-go-boun...@computer-go.org namens Philipp Hennig
Verzonden: ma 2-3-2009 1:04
Aan: computer-go@computer-go.org
Onderwerp: RE: [computer-go] re-CGT approximating the sum of subgames
Hi Martin, Dave and others,
I have never posted to this list before (so, hi everyone! :-), but
your disc
Hi Martin, Dave and others,
I have never posted to this list before (so, hi everyone! :-), but
your discussion on approximate CGT caught my eye.
Dave. you mentioned that you are interested in trying to mix UCT and
CGT:
Dave Devos wrote on 19 Feb 2009, 19:33 GMT:
Ok, I'll look into your tem
mputer-go.org namens Martin Mueller
Verzonden: do 19-2-2009 0:39
Aan: computer-go
Onderwerp: [computer-go] re-CGT approximating the sum of subgames
I can see in your examples here that the space complexity of the sum
itself grows like 2^terms if the terms are simple forms but not
I can see in your examples here that the space complexity of the
sum itself grows like 2^terms if the terms are simple forms but not
numbers.
(I also took the liberty of adding your examples to my unit tests :)
Does computation time grow much faster than this?
Not sure how bad the worst cas
Martin Mueller
Verzonden: wo 18-2-2009 21:10
Aan: computer-go@computer-go.org
Onderwerp: [computer-go] re-CGT approximating the sum of subgames
> I've been looking into CGT lately and I stumbled on some articles
> about approximating strategies for determining the sum of subgames
> (Ther
I've been looking into CGT lately and I stumbled on some articles
about approximating strategies for determining the sum of subgames
(Thermostrat, MixedStrat, HotStrat etc.)
It is not clear to me why approximating strategies are needed. What
is the problem? Is Ko the problem? Is an exact comp
10 matches
Mail list logo
