. ;-)
Tapani
--
Tapani Raiko, tapani.ra...@tkk.fi, +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/
Vlad Dumitrescu wrote:
On Tue, Nov 24, 2009 at 11:18, Tapani Raiko pra...@cis.hut.fi 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 thought: if the bet is I can beat
for the opportunity!
Tapani Raiko
--
Tapani Raiko, tapani.ra...@tkk.fi, +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/
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, tapani.ra...@tkk.fi, +358
, 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 _not_ find a move that creates a winning
://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/
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 deeper nodes, if I
understood them correctly.
--
Tapani Raiko, [EMAIL PROTECTED], +358 50
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
http://www.cis.hut.fi/praiko
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://www.computer-go.org/mailman/listinfo
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 mailing list
computer-go@computer
. (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
http://www.cis.hut.fi/praiko
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 moves by
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.cis.hut.fi/praiko
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
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@computer-go.org
http://www.computer-go.org
15 matches
Mail list logo
