Gian-Carlo Pascutto: <[EMAIL PROTECTED]>:
>Olivier Teytaud wrote:
>
>> Also, there are probably other people interested in combining
>> UCT and mpi; I don't know if some people have a more precise idea
>> of the level of the MPI+UCT combination than us. Someone ?
>
>MPI is just a parallel programm
I think Michael is saying that the MPI version is effectively a
different program, although it's very similar.
So "effective speedup" could be slightly misleading. So on 2
processors we might imagine it might be 1.8 X faster by some measure,
but it's probably not the same as a single process
There is a fairly recent paper dealing with parallelization of UCT by Tristan
Cazenave and Nicolas Jouandeau.
On the parallelization of UCT.
In CGW 2007, pages 93-101, June 2007.
[ http://www.ai.univ-paris8.fr/~cazenave/parallelUCT.pdf ]
The authors tried three methods.
1) multiple UCT algori
So what? That is not relevant, as long as the algorithm is still
"UCT-like" even when parallelized, so that Don's scaling research holds.
How they parallelize is completely irrelevant as long as they measure
effective speedup, i.e. time to find the best move. There is absolutely
no requirement
Michael Williams wrote:
Gian-Carlo Pascutto wrote:
Olivier Teytaud wrote:
Also, there are probably other people interested in combining
UCT and mpi; I don't know if some people have a more precise idea
of the level of the MPI+UCT combination than us. Someone ?
MPI is just a parallel programm
Gian-Carlo Pascutto wrote:
Olivier Teytaud wrote:
Also, there are probably other people interested in combining
UCT and mpi; I don't know if some people have a more precise idea
of the level of the MPI+UCT combination than us. Someone ?
MPI is just a parallel programming model/library, right?
Olivier Teytaud wrote:
Also, there are probably other people interested in combining
UCT and mpi; I don't know if some people have a more precise idea
of the level of the MPI+UCT combination than us. Someone ?
MPI is just a parallel programming model/library, right?
So the only thing to know
Has this estimation been done?Does anyone here have a sense of how
strong the very best Mogo versions play?
We often compare a version X to a version Y,
and have notable successes for this criterion, for all boardsizes;
but we have only statistics of self-play, and usually with shorter
time
There is a huge difference in strength from one Mogo version to the
next.
Has this estimation been done?Does anyone here have a sense of how
strong the very best Mogo versions play?
- Don
Gian-Carlo Pascutto wrote:
> Don Dailey wrote:
>
>> It's not very clear to me how strong Mogo is a
It's not very clear to me how strong Mogo is at 19x19. I have no idea.
Can't we estimate from KGS games?
k
Due to hardware and library constraints,
mpi-mogo is not on KGS.
Olivier
___
computer-go mailing list
computer-go@computer-go.org
http://www.
Don Dailey wrote:
It's not very clear to me how strong Mogo is at 19x19. I have no idea.
Can't we estimate from KGS games?
You'd need to know exactly how fast the hardware is, of course.
--
GCP
___
computer-go mailing list
computer-go@computer-go
Alain Baeckeroot wrote:
> Le samedi 12 janvier 2008, Olivier Teytaud a écrit :
>
>> [game against MoGo and a professional player]
>>
>>
It will be the MPI version of mogo, and in various board-sizes.
>>> What handicap, if any?
>>>
>> I don't know yet.
>>
>
>
When the engine crashes, the tcl scripts sends the last move from the
opponent, and the engine loses on "Illegal move to occupied point". Not sure
if anybody has reported this bug and latest script has fixed the issue.
The following is part of the script log on game 251055. The full log of the
gam
Le samedi 12 janvier 2008, Olivier Teytaud a écrit :
> [game against MoGo and a professional player]
>
> >> It will be the MPI version of mogo, and in various board-sizes.
> >
> >What handicap, if any?
>
> I don't know yet.
There is lot of room to show improvements. JL Gaily reports
games with m
The success of the UCT-MC method, especially in the 19x19 Go game, surprises
many people. It has been?mostly atributed to?the special features of the UCT
algorithm. These features does play an essential roles They made it possible
for the evaluation method of Monte-Carlo to work. However, the su
[game between mogo and a professional player]
What will be the hardware for Mogo ?
The hardware should be provided by Bull
(cluster of multi-core machines, with good
communications - this last point is
very important).
By the way I point out that the hardware
for public games is provided by
Hi, By any chance does anyone have a tip to help me get VisualTree working?
http://www.cs.unimaas.nl/g.chaslot/vt/vt09/docs/install.html says I should run
" java -jar vtbeta.jar"
but this produces the error:
Exception in thread "main" java.lang.NoClassDefFoundError:
net/sf/gogui/utils/ErrorMess
[game between mogo and a professional player]
What will be the hardware for Mogo ?
The hardware should be provided by Bull
(cluster of multi-core machines, with good
communications - this last point is
very important).
Olivier
___
computer-go mailin
[game against MoGo and a professional player]
It will be the MPI version of mogo, and in various board-sizes.
What handicap, if any?
I don't know yet.
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listi
19 matches
Mail list logo
