Vlad Dumitrescu wrote:
> On Tue, Nov 24, 2009 at 11:18, Tapani Raiko wrote:
>
>> One can also play a single game for instance with money bets based on
>> the Hahn points, which makes Hahn go strategy relevant also for a single
>> game.
>>
>
> Just a th
ion from the other boards. ;-)
Tapani
--
Tapani Raiko, , +358 50 5225750
http://www.iki.fi/raiko/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Hi,
For Fuego, in addition to "uct_param_player max_games 10" I think
you should also set "uct_param_player ignore_clock 1" and
"uct_param_player ponder 0".
Tapani Raiko
?ukasz Lew wrote:
> Hi,
>
> Is there a way to set up MoGo so it has the same play
teams for the opportunity!
Tapani Raiko
--
Tapani Raiko, , +358 50 5225750
http://www.iki.fi/raiko/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
Hi,
Thank a lot for your fast answers and offers!
Maybe I should just pick one for simplicity, perhaps Mogo would be fine.
(There won't be time to try many programs anyway.)
The Cray has 48 cores (6 nodes that each have a 2 x quad core Xeon E5472
3.0GHz CPU and 32 GB RAM). I am hoping to get
need to
use MPI.
I am now asking for help. Do you know which program could be used for best
performance (or most cores)? Is it easy to set up things running? (I need to
decide soon whether I will organize it or not.)
Thanks in advance,
Tapani Raiko
--
Tapani Raiko, , +358 50 5225750
http
y greedily, while random passing during playouts
would make black play safe (rich men don't pick fights).
Tapani Raiko
Christoph Birk wrote:
>
> I think you got it the wrong way round.
> Without dynamic komi (in high ha
> ndicap games) even trillions of simulations
> with _n
es GTP. Here's a link:
http://mgame99.mg.funpic.de/downloads.php
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.cis.hut.fi/praiko/
___
computer-go mailing list
computer-go@computer-go.org
http://www.computer-go.org/mailman/listinfo/computer-go/
the trees of all the computers
could grow very large. Of course some central intelligence would need to
allocate resources to different branches dynamically, so it would be
more difficult to implement. In these three milestones, the different
computers would do a lot of overlapping work with the deep
Chris Fant wrote:
> Ho can I find Go vids on youtube? Searching for "go" obviously does nothing.
>
>
Atari was also a good keyword here. There it is:
http://www.youtube.com/watch?v=qt1FvPxmmfE
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
htt
null-move tweak, use a
supercomputer, and claim to have the strongest computer Go player ever. :-)
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.cis.hut.fi/praiko/
___
computer-go mailing list
computer-go@computer-go.org
http:
er than 9x9=81. (Go81 only has 3x3 patterns.)
There is also a GTP-supporting .exe so you can test the strength without
a Palm. On a PC the two playouts don't take much time. ;-)
http://www.cis.hut.fi/praiko/go169/
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
htt
t are close to both white and black areas)
and so on. Similar heuristics might be useful deeper in the UCT where
there are very few play-outs.
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.cis.hut.fi/praiko/
___
computer-go
For instance in the 3D diamond graph,
each node (disregarding the edges) has 4 neighbors as usual, but there
are 12 neighbor's neighbors, whereas normal Go board has only 8 (4
diagonals and 4 one-point jumps). I'd say there is a huge difference.
--
Tapani Raiko, <[EMAI
to ruin it. In normal 2D Go, you surround
area by strings and ruin area by strings, so there is a nice balance. My
guess is that Go in any other dimensionality than two would be dull.
Playing on the surface of a ball, a torus, or a Klein bottle might be
fun, though.
--
Tapani Raiko, <[EMAIL PROT
> > I could see a case where it is possible to reduce a variance of a single
> > variable even in the 0-1 case. Let us say that black has about 5% chances of
> > winning. If we could (exactly) double the chances of black winning by
> > changing the nonuniform sampling somehow (say, enforce bad move
ed towards white win, which is
realistic since white is assumed to be a stronger player, anyway.
To summarise, I agree that there are links to other MC research, and they
should be explored.
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.c
> Would the results of kgs (or similar) games being appropriate if one
> considered only un-handicapped games?
Yes, I think so. At least when considering only those who have played lots
of games against lots of opponents.
> I imagine that the most significant intransitivity would be would be in
erence on Artificial intelligence, SCAI 2006, pp.
189-195, Espoo, Finland, October 25-27, 2006.
http://www.cis.hut.fi/praiko/papers/scai06.pdf
Tapani
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.cis.hut.fi/praiko/
_
t clear who is the one trying to capture
and should thus get the first move.
One more vote for simple rules. :)
--
Tapani Raiko, <[EMAIL PROTECTED]>, +358 50 5225750
http://www.cis.hut.fi/praiko/
___
computer-go mailing list
computer-go@compute
20 matches
Mail list logo
